/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 20:46:20,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 20:46:20,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 20:46:20,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 20:46:20,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 20:46:20,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 20:46:20,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 20:46:20,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 20:46:20,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 20:46:20,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 20:46:20,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 20:46:20,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 20:46:20,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 20:46:20,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 20:46:20,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 20:46:20,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 20:46:20,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 20:46:20,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 20:46:20,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 20:46:20,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 20:46:20,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 20:46:20,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 20:46:20,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 20:46:20,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 20:46:20,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 20:46:20,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 20:46:20,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 20:46:20,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 20:46:20,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 20:46:20,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 20:46:20,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 20:46:20,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 20:46:20,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 20:46:20,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 20:46:20,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 20:46:20,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 20:46:20,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 20:46:20,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 20:46:20,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 20:46:20,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 20:46:20,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 20:46:20,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 20:46:20,866 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 20:46:20,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 20:46:20,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 20:46:20,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 20:46:20,868 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 20:46:20,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 20:46:20,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 20:46:20,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 20:46:20,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 20:46:20,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 20:46:20,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 20:46:20,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 20:46:20,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 20:46:20,870 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 20:46:20,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 20:46:20,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 20:46:20,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 20:46:20,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 20:46:20,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 20:46:20,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 20:46:20,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 20:46:20,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 20:46:20,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 20:46:20,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 20:46:20,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 20:46:20,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 20:46:20,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 20:46:20,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 20:46:20,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 20:46:20,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 20:46:21,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 20:46:21,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 20:46:21,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 20:46:21,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 20:46:21,213 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 20:46:21,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2019-12-26 20:46:21,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48238a4df/003ef8709fce4cb7a7a8baa890b64e09/FLAGa3dc44b76 [2019-12-26 20:46:21,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 20:46:21,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2019-12-26 20:46:21,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48238a4df/003ef8709fce4cb7a7a8baa890b64e09/FLAGa3dc44b76 [2019-12-26 20:46:22,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48238a4df/003ef8709fce4cb7a7a8baa890b64e09 [2019-12-26 20:46:22,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 20:46:22,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 20:46:22,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 20:46:22,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 20:46:22,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 20:46:22,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:22,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a7e112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22, skipping insertion in model container [2019-12-26 20:46:22,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:22,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 20:46:22,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 20:46:22,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:46:22,760 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 20:46:22,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:46:22,992 INFO L208 MainTranslator]: Completed translation [2019-12-26 20:46:22,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22 WrapperNode [2019-12-26 20:46:22,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 20:46:22,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 20:46:22,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 20:46:22,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 20:46:23,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 20:46:23,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 20:46:23,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 20:46:23,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 20:46:23,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (1/1) ... [2019-12-26 20:46:23,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 20:46:23,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 20:46:23,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 20:46:23,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 20:46:23,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (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-26 20:46:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-26 20:46:23,194 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-26 20:46:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-26 20:46:23,194 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-26 20:46:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 20:46:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 20:46:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-26 20:46:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 20:46:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-26 20:46:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-26 20:46:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 20:46:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 20:46:23,198 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 20:46:23,870 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 20:46:23,871 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-26 20:46:23,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:46:23 BoogieIcfgContainer [2019-12-26 20:46:23,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 20:46:23,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 20:46:23,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 20:46:23,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 20:46:23,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 08:46:22" (1/3) ... [2019-12-26 20:46:23,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51404b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:46:23, skipping insertion in model container [2019-12-26 20:46:23,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:46:22" (2/3) ... [2019-12-26 20:46:23,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51404b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:46:23, skipping insertion in model container [2019-12-26 20:46:23,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:46:23" (3/3) ... [2019-12-26 20:46:23,881 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2019-12-26 20:46:23,891 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 20:46:23,892 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 20:46:23,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 20:46:23,901 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 20:46:23,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,947 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,947 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,949 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,949 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,949 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,950 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,950 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,950 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,951 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,952 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,952 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,952 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,952 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,952 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,953 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,953 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,953 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,953 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,953 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,954 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,954 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,955 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,955 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,955 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,956 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,957 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,957 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,958 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,958 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,958 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,959 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,959 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,959 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,959 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,960 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,960 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,961 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,961 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,961 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,961 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,961 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,962 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,962 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,962 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,962 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,962 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,963 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,963 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,963 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,963 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,963 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,963 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,964 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,964 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,964 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,964 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,964 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,965 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,965 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,965 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,965 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,965 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,966 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,966 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,966 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,966 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,966 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,966 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,967 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,967 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,967 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,967 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,968 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,969 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,969 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,969 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,970 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,970 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,970 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,971 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,971 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,971 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,971 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,972 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,972 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,972 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,972 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,972 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,973 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,973 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,973 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,973 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,973 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,974 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,974 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,974 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,974 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,974 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,975 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,975 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,975 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,975 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,975 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,975 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,978 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,979 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,979 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,980 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,980 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,981 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,983 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,983 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,983 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,983 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,983 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,984 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,984 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,984 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,984 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,985 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,985 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,986 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,986 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,987 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,989 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,989 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,989 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,989 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,989 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,990 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,990 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,990 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,991 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,996 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,996 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,996 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,996 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,997 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,997 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,997 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,997 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,997 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,998 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,998 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,998 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,998 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,998 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,999 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,999 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,999 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,999 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,999 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:23,999 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,000 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,000 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,000 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,006 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,008 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,008 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,009 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,010 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,010 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,011 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,011 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,011 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,011 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,011 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,012 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:46:24,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 20:46:24,054 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:46:24,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:46:24,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:46:24,055 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:46:24,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:46:24,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:46:24,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:46:24,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:46:24,072 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 204 transitions [2019-12-26 20:46:24,073 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-26 20:46:24,167 INFO L132 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-26 20:46:24,168 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-26 20:46:24,180 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-26 20:46:24,196 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-26 20:46:24,248 INFO L132 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-26 20:46:24,249 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-26 20:46:24,254 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-26 20:46:24,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 9440 [2019-12-26 20:46:24,267 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:46:27,603 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-26 20:46:28,503 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-26 20:46:28,626 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-26 20:46:29,493 WARN L192 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-12-26 20:46:29,743 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-12-26 20:46:30,633 WARN L192 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2019-12-26 20:46:30,958 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-12-26 20:46:30,979 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17748 [2019-12-26 20:46:30,979 INFO L214 etLargeBlockEncoding]: Total number of compositions: 178 [2019-12-26 20:46:30,982 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 55 transitions [2019-12-26 20:46:31,025 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 716 states. [2019-12-26 20:46:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2019-12-26 20:46:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-26 20:46:31,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:31,034 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-26 20:46:31,035 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash 810, now seen corresponding path program 1 times [2019-12-26 20:46:31,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:31,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249157577] [2019-12-26 20:46:31,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:31,172 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-26 20:46:31,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249157577] [2019-12-26 20:46:31,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:46:31,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-26 20:46:31,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578589763] [2019-12-26 20:46:31,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-26 20:46:31,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-26 20:46:31,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-26 20:46:31,198 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 2 states. [2019-12-26 20:46:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:31,244 INFO L93 Difference]: Finished difference Result 715 states and 1901 transitions. [2019-12-26 20:46:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-26 20:46:31,245 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-26 20:46:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:31,273 INFO L225 Difference]: With dead ends: 715 [2019-12-26 20:46:31,273 INFO L226 Difference]: Without dead ends: 524 [2019-12-26 20:46:31,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-26 20:46:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-26 20:46:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-26 20:46:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-26 20:46:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1400 transitions. [2019-12-26 20:46:31,375 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1400 transitions. Word has length 1 [2019-12-26 20:46:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:31,375 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1400 transitions. [2019-12-26 20:46:31,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-26 20:46:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1400 transitions. [2019-12-26 20:46:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 20:46:31,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:31,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:31,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1385599744, now seen corresponding path program 1 times [2019-12-26 20:46:31,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:31,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82468429] [2019-12-26 20:46:31,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:31,564 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-26 20:46:31,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82468429] [2019-12-26 20:46:31,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:46:31,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 20:46:31,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472791558] [2019-12-26 20:46:31,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:46:31,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:31,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:46:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:46:31,567 INFO L87 Difference]: Start difference. First operand 524 states and 1400 transitions. Second operand 3 states. [2019-12-26 20:46:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:31,578 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2019-12-26 20:46:31,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:46:31,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 20:46:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:31,580 INFO L225 Difference]: With dead ends: 236 [2019-12-26 20:46:31,581 INFO L226 Difference]: Without dead ends: 212 [2019-12-26 20:46:31,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:46:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-26 20:46:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-12-26 20:46:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-26 20:46:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 464 transitions. [2019-12-26 20:46:31,591 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 464 transitions. Word has length 15 [2019-12-26 20:46:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:31,592 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 464 transitions. [2019-12-26 20:46:31,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:46:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 464 transitions. [2019-12-26 20:46:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 20:46:31,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:31,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:31,595 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1061498615, now seen corresponding path program 1 times [2019-12-26 20:46:31,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:31,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875721677] [2019-12-26 20:46:31,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:31,674 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-26 20:46:31,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875721677] [2019-12-26 20:46:31,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:46:31,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:46:31,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589070125] [2019-12-26 20:46:31,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:46:31,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:46:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:46:31,676 INFO L87 Difference]: Start difference. First operand 212 states and 464 transitions. Second operand 3 states. [2019-12-26 20:46:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:31,711 INFO L93 Difference]: Finished difference Result 272 states and 590 transitions. [2019-12-26 20:46:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:46:31,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 20:46:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:31,716 INFO L225 Difference]: With dead ends: 272 [2019-12-26 20:46:31,716 INFO L226 Difference]: Without dead ends: 272 [2019-12-26 20:46:31,719 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-26 20:46:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-26 20:46:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 218. [2019-12-26 20:46:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-26 20:46:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 476 transitions. [2019-12-26 20:46:31,738 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 476 transitions. Word has length 19 [2019-12-26 20:46:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:31,738 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 476 transitions. [2019-12-26 20:46:31,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:46:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2019-12-26 20:46:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 20:46:31,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:31,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:31,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1197878433, now seen corresponding path program 1 times [2019-12-26 20:46:31,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:31,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063843807] [2019-12-26 20:46:31,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:31,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063843807] [2019-12-26 20:46:31,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:46:31,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:46:31,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291247034] [2019-12-26 20:46:31,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:46:31,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:46:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:46:31,889 INFO L87 Difference]: Start difference. First operand 218 states and 476 transitions. Second operand 3 states. [2019-12-26 20:46:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:31,904 INFO L93 Difference]: Finished difference Result 166 states and 334 transitions. [2019-12-26 20:46:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:46:31,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 20:46:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:31,905 INFO L225 Difference]: With dead ends: 166 [2019-12-26 20:46:31,906 INFO L226 Difference]: Without dead ends: 164 [2019-12-26 20:46:31,906 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-26 20:46:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-26 20:46:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-26 20:46:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-26 20:46:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2019-12-26 20:46:31,913 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 26 [2019-12-26 20:46:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:31,913 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2019-12-26 20:46:31,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:46:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2019-12-26 20:46:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 20:46:31,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:31,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:31,915 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:31,915 INFO L82 PathProgramCache]: Analyzing trace with hash -969107883, now seen corresponding path program 1 times [2019-12-26 20:46:31,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:31,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848246346] [2019-12-26 20:46:31,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:32,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848246346] [2019-12-26 20:46:32,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998966452] [2019-12-26 20:46:32,044 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-26 20:46:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:32,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-26 20:46:32,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:32,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:32,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-26 20:46:32,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672493341] [2019-12-26 20:46:32,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:46:32,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:32,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:46:32,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:46:32,195 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand 5 states. [2019-12-26 20:46:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:32,232 INFO L93 Difference]: Finished difference Result 240 states and 472 transitions. [2019-12-26 20:46:32,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:46:32,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 20:46:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:32,238 INFO L225 Difference]: With dead ends: 240 [2019-12-26 20:46:32,238 INFO L226 Difference]: Without dead ends: 240 [2019-12-26 20:46:32,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:46:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-26 20:46:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2019-12-26 20:46:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-26 20:46:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 405 transitions. [2019-12-26 20:46:32,248 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 405 transitions. Word has length 27 [2019-12-26 20:46:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:32,249 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 405 transitions. [2019-12-26 20:46:32,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:46:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 405 transitions. [2019-12-26 20:46:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 20:46:32,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:32,258 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:32,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:32,472 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1561383711, now seen corresponding path program 2 times [2019-12-26 20:46:32,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:32,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399187722] [2019-12-26 20:46:32,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399187722] [2019-12-26 20:46:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046086287] [2019-12-26 20:46:32,550 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-26 20:46:32,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:46:32,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:32,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-26 20:46:32,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:32,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:32,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-26 20:46:32,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375261897] [2019-12-26 20:46:32,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 20:46:32,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 20:46:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 20:46:32,724 INFO L87 Difference]: Start difference. First operand 204 states and 405 transitions. Second operand 6 states. [2019-12-26 20:46:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:32,763 INFO L93 Difference]: Finished difference Result 280 states and 546 transitions. [2019-12-26 20:46:32,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:46:32,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 20:46:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:32,768 INFO L225 Difference]: With dead ends: 280 [2019-12-26 20:46:32,768 INFO L226 Difference]: Without dead ends: 280 [2019-12-26 20:46:32,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 20:46:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-26 20:46:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2019-12-26 20:46:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-26 20:46:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 479 transitions. [2019-12-26 20:46:32,777 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 479 transitions. Word has length 34 [2019-12-26 20:46:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:32,777 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 479 transitions. [2019-12-26 20:46:32,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 20:46:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2019-12-26 20:46:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 20:46:32,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:32,781 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:32,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:32,982 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash -303137003, now seen corresponding path program 3 times [2019-12-26 20:46:32,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:32,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869195613] [2019-12-26 20:46:32,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869195613] [2019-12-26 20:46:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956311969] [2019-12-26 20:46:33,089 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-26 20:46:33,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-26 20:46:33,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:33,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-26 20:46:33,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:33,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:33,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-26 20:46:33,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434783306] [2019-12-26 20:46:33,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 20:46:33,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 20:46:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-26 20:46:33,505 INFO L87 Difference]: Start difference. First operand 244 states and 479 transitions. Second operand 7 states. [2019-12-26 20:46:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:33,565 INFO L93 Difference]: Finished difference Result 320 states and 620 transitions. [2019-12-26 20:46:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 20:46:33,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-26 20:46:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:33,569 INFO L225 Difference]: With dead ends: 320 [2019-12-26 20:46:33,569 INFO L226 Difference]: Without dead ends: 320 [2019-12-26 20:46:33,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-26 20:46:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-26 20:46:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2019-12-26 20:46:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-12-26 20:46:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 553 transitions. [2019-12-26 20:46:33,579 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 553 transitions. Word has length 41 [2019-12-26 20:46:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:33,579 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 553 transitions. [2019-12-26 20:46:33,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 20:46:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 553 transitions. [2019-12-26 20:46:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 20:46:33,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:33,581 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:33,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:33,788 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:33,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1439404639, now seen corresponding path program 4 times [2019-12-26 20:46:33,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:33,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856057308] [2019-12-26 20:46:33,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:33,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856057308] [2019-12-26 20:46:33,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103855762] [2019-12-26 20:46:33,909 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:34,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:46:34,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:34,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-26 20:46:34,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:34,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:34,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-26 20:46:34,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073342414] [2019-12-26 20:46:34,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 20:46:34,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:34,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 20:46:34,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-26 20:46:34,079 INFO L87 Difference]: Start difference. First operand 284 states and 553 transitions. Second operand 8 states. [2019-12-26 20:46:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:34,139 INFO L93 Difference]: Finished difference Result 360 states and 694 transitions. [2019-12-26 20:46:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 20:46:34,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-12-26 20:46:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:34,142 INFO L225 Difference]: With dead ends: 360 [2019-12-26 20:46:34,142 INFO L226 Difference]: Without dead ends: 360 [2019-12-26 20:46:34,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-26 20:46:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-26 20:46:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2019-12-26 20:46:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-26 20:46:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 627 transitions. [2019-12-26 20:46:34,153 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 627 transitions. Word has length 48 [2019-12-26 20:46:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:34,153 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 627 transitions. [2019-12-26 20:46:34,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 20:46:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 627 transitions. [2019-12-26 20:46:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 20:46:34,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:34,155 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:34,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:34,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2001070123, now seen corresponding path program 5 times [2019-12-26 20:46:34,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:34,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075985739] [2019-12-26 20:46:34,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:34,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075985739] [2019-12-26 20:46:34,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500962457] [2019-12-26 20:46:34,490 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:34,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-26 20:46:34,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:34,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-26 20:46:34,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:34,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-26 20:46:34,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:34,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:34,700 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:34,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-26 20:46:34,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:34,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-26 20:46:34,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:34,781 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-26 20:46:34,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:34,788 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:34,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-26 20:46:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:34,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:34,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:34,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:34,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-26 20:46:34,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:34,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:34,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-26 20:46:34,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:34,918 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,017 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-26 20:46:35,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:35,018 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-26 20:46:35,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:35,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:35,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:35,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-26 20:46:35,092 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:35,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:35,123 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-26 20:46:35,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-26 20:46:35,187 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:35,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,198 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-26 20:46:35,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:35,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:35,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:35,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:46:35,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-26 20:46:35,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:35,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-26 20:46:35,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,361 INFO L614 ElimStorePlain]: treesize reduction 69, result has 28.1 percent of original size [2019-12-26 20:46:35,361 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-26 20:46:35,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2019-12-26 20:46:35,394 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-26 20:46:35,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:35,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:35,402 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-26 20:46:35,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-26 20:46:35,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-26 20:46:35,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:35,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:35,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-26 20:46:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-26 20:46:35,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:35,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-12-26 20:46:35,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221013106] [2019-12-26 20:46:35,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 20:46:35,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:35,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 20:46:35,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:46:35,421 INFO L87 Difference]: Start difference. First operand 324 states and 627 transitions. Second operand 17 states. [2019-12-26 20:46:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:38,380 INFO L93 Difference]: Finished difference Result 990 states and 1887 transitions. [2019-12-26 20:46:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 20:46:38,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-26 20:46:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:38,388 INFO L225 Difference]: With dead ends: 990 [2019-12-26 20:46:38,388 INFO L226 Difference]: Without dead ends: 990 [2019-12-26 20:46:38,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=738, Invalid=2342, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 20:46:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-26 20:46:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 640. [2019-12-26 20:46:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-26 20:46:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1212 transitions. [2019-12-26 20:46:38,413 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1212 transitions. Word has length 55 [2019-12-26 20:46:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:38,414 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1212 transitions. [2019-12-26 20:46:38,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 20:46:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1212 transitions. [2019-12-26 20:46:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 20:46:38,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:38,416 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:38,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:38,629 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1721466975, now seen corresponding path program 1 times [2019-12-26 20:46:38,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:38,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900893182] [2019-12-26 20:46:38,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:38,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900893182] [2019-12-26 20:46:38,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734117918] [2019-12-26 20:46:38,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:38,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-26 20:46:38,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:38,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:38,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-26 20:46:38,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717173144] [2019-12-26 20:46:38,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 20:46:38,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 20:46:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-26 20:46:38,970 INFO L87 Difference]: Start difference. First operand 640 states and 1212 transitions. Second operand 10 states. [2019-12-26 20:46:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:39,027 INFO L93 Difference]: Finished difference Result 828 states and 1557 transitions. [2019-12-26 20:46:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 20:46:39,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-26 20:46:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:39,033 INFO L225 Difference]: With dead ends: 828 [2019-12-26 20:46:39,034 INFO L226 Difference]: Without dead ends: 828 [2019-12-26 20:46:39,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-26 20:46:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-26 20:46:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 740. [2019-12-26 20:46:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-12-26 20:46:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1395 transitions. [2019-12-26 20:46:39,057 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1395 transitions. Word has length 64 [2019-12-26 20:46:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:39,057 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 1395 transitions. [2019-12-26 20:46:39,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 20:46:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1395 transitions. [2019-12-26 20:46:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-26 20:46:39,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:39,059 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:39,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:39,264 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1068182613, now seen corresponding path program 2 times [2019-12-26 20:46:39,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:39,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316323056] [2019-12-26 20:46:39,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:39,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316323056] [2019-12-26 20:46:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480661352] [2019-12-26 20:46:39,451 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:39,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:46:39,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:39,666 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-26 20:46:39,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:39,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:39,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-26 20:46:39,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678224650] [2019-12-26 20:46:39,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 20:46:39,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 20:46:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-26 20:46:39,698 INFO L87 Difference]: Start difference. First operand 740 states and 1395 transitions. Second operand 11 states. [2019-12-26 20:46:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:39,770 INFO L93 Difference]: Finished difference Result 928 states and 1740 transitions. [2019-12-26 20:46:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 20:46:39,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-12-26 20:46:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:39,777 INFO L225 Difference]: With dead ends: 928 [2019-12-26 20:46:39,778 INFO L226 Difference]: Without dead ends: 928 [2019-12-26 20:46:39,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-26 20:46:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-12-26 20:46:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 840. [2019-12-26 20:46:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-26 20:46:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1578 transitions. [2019-12-26 20:46:39,800 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1578 transitions. Word has length 71 [2019-12-26 20:46:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:39,800 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1578 transitions. [2019-12-26 20:46:39,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 20:46:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1578 transitions. [2019-12-26 20:46:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-26 20:46:39,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:39,803 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:40,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:40,008 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1341473003, now seen corresponding path program 3 times [2019-12-26 20:46:40,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:40,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691370476] [2019-12-26 20:46:40,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:40,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691370476] [2019-12-26 20:46:40,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616711684] [2019-12-26 20:46:40,189 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:41,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-26 20:46:41,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:41,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-26 20:46:41,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:41,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:41,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 287 [2019-12-26 20:46:41,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:41,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,029 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 30 [2019-12-26 20:46:42,030 INFO L614 ElimStorePlain]: treesize reduction 2996, result has 1.4 percent of original size [2019-12-26 20:46:42,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,031 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:4 [2019-12-26 20:46:42,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-26 20:46:42,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-26 20:46:42,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:42,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,113 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-26 20:46:42,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2019-12-26 20:46:42,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:42,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-26 20:46:42,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,193 INFO L614 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2019-12-26 20:46:42,194 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-26 20:46:42,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-12-26 20:46:42,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:42,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:42,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-12-26 20:46:42,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-26 20:46:42,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2019-12-26 20:46:42,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:42,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,308 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-26 20:46:42,308 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2019-12-26 20:46:42,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:42,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-26 20:46:42,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,408 INFO L614 ElimStorePlain]: treesize reduction 26, result has 49.0 percent of original size [2019-12-26 20:46:42,408 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-26 20:46:42,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2019-12-26 20:46:42,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:42,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:42,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,449 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-26 20:46:42,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-26 20:46:42,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-26 20:46:42,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:42,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:42,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:1 [2019-12-26 20:46:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 78 proven. 35 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-26 20:46:42,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:42,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-26 20:46:42,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910111625] [2019-12-26 20:46:42,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 20:46:42,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 20:46:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-26 20:46:42,469 INFO L87 Difference]: Start difference. First operand 840 states and 1578 transitions. Second operand 21 states. [2019-12-26 20:46:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:45,005 INFO L93 Difference]: Finished difference Result 1276 states and 2352 transitions. [2019-12-26 20:46:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-26 20:46:45,005 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2019-12-26 20:46:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:45,012 INFO L225 Difference]: With dead ends: 1276 [2019-12-26 20:46:45,012 INFO L226 Difference]: Without dead ends: 1276 [2019-12-26 20:46:45,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1143, Invalid=4113, Unknown=0, NotChecked=0, Total=5256 [2019-12-26 20:46:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-26 20:46:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 888. [2019-12-26 20:46:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-12-26 20:46:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1638 transitions. [2019-12-26 20:46:45,039 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1638 transitions. Word has length 79 [2019-12-26 20:46:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:45,040 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1638 transitions. [2019-12-26 20:46:45,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 20:46:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1638 transitions. [2019-12-26 20:46:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-26 20:46:45,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:45,043 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:45,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:45,249 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1962857127, now seen corresponding path program 4 times [2019-12-26 20:46:45,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:45,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429624324] [2019-12-26 20:46:45,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:45,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429624324] [2019-12-26 20:46:45,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980265491] [2019-12-26 20:46:45,403 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:49,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:46:49,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:49,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-26 20:46:49,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:49,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:49,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-26 20:46:49,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412752957] [2019-12-26 20:46:49,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 20:46:49,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 20:46:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-26 20:46:49,279 INFO L87 Difference]: Start difference. First operand 888 states and 1638 transitions. Second operand 13 states. [2019-12-26 20:46:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:46:49,367 INFO L93 Difference]: Finished difference Result 1060 states and 1947 transitions. [2019-12-26 20:46:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 20:46:49,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-12-26 20:46:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:46:49,373 INFO L225 Difference]: With dead ends: 1060 [2019-12-26 20:46:49,373 INFO L226 Difference]: Without dead ends: 1060 [2019-12-26 20:46:49,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-26 20:46:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-26 20:46:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 980. [2019-12-26 20:46:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-26 20:46:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1803 transitions. [2019-12-26 20:46:49,395 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1803 transitions. Word has length 88 [2019-12-26 20:46:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:46:49,395 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1803 transitions. [2019-12-26 20:46:49,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 20:46:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1803 transitions. [2019-12-26 20:46:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 20:46:49,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:46:49,400 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:46:49,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:46:49,601 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:46:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:46:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1574165281, now seen corresponding path program 5 times [2019-12-26 20:46:49,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:46:49,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936703597] [2019-12-26 20:46:49,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:46:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:46:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:46:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936703597] [2019-12-26 20:46:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576170885] [2019-12-26 20:46:49,758 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-26 20:46:53,126 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-26 20:46:53,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:46:53,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 132 conjunts are in the unsatisfiable core [2019-12-26 20:46:53,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:46:53,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-26 20:46:53,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-26 20:46:53,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-26 20:46:53,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,232 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-26 20:46:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:53,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-26 20:46:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-26 20:46:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:53,401 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-26 20:46:53,403 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,498 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-26 20:46:53,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:53,500 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-26 20:46:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:53,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:53,557 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-26 20:46:53,563 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,592 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:53,592 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-26 20:46:53,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-26 20:46:53,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,737 INFO L614 ElimStorePlain]: treesize reduction 11, result has 85.7 percent of original size [2019-12-26 20:46:53,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-26 20:46:53,742 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,763 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:53,764 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:45 [2019-12-26 20:46:53,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:53,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-26 20:46:53,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:53,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-26 20:46:53,871 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:53,950 INFO L614 ElimStorePlain]: treesize reduction 24, result has 79.3 percent of original size [2019-12-26 20:46:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:53,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-26 20:46:53,953 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2019-12-26 20:46:54,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-26 20:46:54,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-26 20:46:54,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:54,120 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,121 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-26 20:46:54,121 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,214 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-26 20:46:54,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:54,215 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-26 20:46:54,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-26 20:46:54,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:54,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:54,309 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:54,343 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-26 20:46:54,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-26 20:46:54,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,536 INFO L614 ElimStorePlain]: treesize reduction 10, result has 87.0 percent of original size [2019-12-26 20:46:54,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-26 20:46:54,540 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:54,555 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:45 [2019-12-26 20:46:54,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-26 20:46:54,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:54,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-26 20:46:54,645 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,725 INFO L614 ElimStorePlain]: treesize reduction 24, result has 79.3 percent of original size [2019-12-26 20:46:54,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-26 20:46:54,726 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2019-12-26 20:46:54,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:54,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:54,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-26 20:46:54,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:54,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:54,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-26 20:46:54,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:54,885 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-26 20:46:54,982 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-26 20:46:54,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:54,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-26 20:46:55,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:46:55,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-26 20:46:55,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:55,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:55,066 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-26 20:46:55,112 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-26 20:46:55,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-26 20:46:55,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-26 20:46:55,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:55,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-26 20:46:55,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,265 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-26 20:46:55,265 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2019-12-26 20:46:55,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:55,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-26 20:46:55,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,426 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-26 20:46:55,427 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-26 20:46:55,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-26 20:46:55,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:55,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:55,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,512 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-26 20:46:55,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-26 20:46:55,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-26 20:46:55,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,644 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-26 20:46:55,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:55,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:55,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,711 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-26 20:46:55,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-26 20:46:55,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:55,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-26 20:46:55,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,908 INFO L614 ElimStorePlain]: treesize reduction 26, result has 65.3 percent of original size [2019-12-26 20:46:55,908 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-26 20:46:55,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2019-12-26 20:46:55,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:55,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:55,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:55,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:55,990 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-26 20:46:55,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-26 20:46:56,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-26 20:46:56,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:56,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-26 20:46:56,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:56,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:56,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:56,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:46:56,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-26 20:46:56,252 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:46:56,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:56,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-26 20:46:56,282 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,307 INFO L614 ElimStorePlain]: treesize reduction 69, result has 28.1 percent of original size [2019-12-26 20:46:56,308 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-26 20:46:56,308 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2019-12-26 20:46:56,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:46:56,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:46:56,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:56,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-26 20:46:56,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-26 20:46:56,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:46:56,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:46:56,360 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-26 20:46:56,360 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-26 20:46:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 213 proven. 56 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-26 20:46:56,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:46:56,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 45 [2019-12-26 20:46:56,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957205904] [2019-12-26 20:46:56,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-26 20:46:56,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:46:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-26 20:46:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1671, Unknown=0, NotChecked=0, Total=1980 [2019-12-26 20:46:56,403 INFO L87 Difference]: Start difference. First operand 980 states and 1803 transitions. Second operand 45 states. [2019-12-26 20:46:58,415 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:46:59,495 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-12-26 20:47:00,089 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-26 20:47:01,487 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-12-26 20:47:02,052 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-12-26 20:47:02,581 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:03,145 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-12-26 20:47:04,537 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-26 20:47:05,283 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-12-26 20:47:05,500 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:47:06,241 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-12-26 20:47:06,421 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:07,297 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-12-26 20:47:08,880 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-26 20:47:09,229 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:47:09,771 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:10,478 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-12-26 20:47:12,020 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-26 20:47:13,220 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:47:13,728 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-12-26 20:47:14,139 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:15,066 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-12-26 20:47:16,215 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-26 20:47:16,767 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:47:17,444 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:17,997 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-12-26 20:47:19,997 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-26 20:47:21,085 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:47:21,689 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-12-26 20:47:22,128 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:24,537 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-26 20:47:25,184 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-26 20:47:25,693 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-12-26 20:47:26,002 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-12-26 20:47:26,550 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-12-26 20:47:27,493 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-26 20:47:27,843 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2019-12-26 20:47:28,410 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-26 20:47:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:47:29,389 INFO L93 Difference]: Finished difference Result 3932 states and 7219 transitions. [2019-12-26 20:47:29,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 304 states. [2019-12-26 20:47:29,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 96 [2019-12-26 20:47:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:47:29,406 INFO L225 Difference]: With dead ends: 3932 [2019-12-26 20:47:29,407 INFO L226 Difference]: Without dead ends: 3932 [2019-12-26 20:47:29,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49834 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=14262, Invalid=93650, Unknown=0, NotChecked=0, Total=107912 [2019-12-26 20:47:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-12-26 20:47:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 2636. [2019-12-26 20:47:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-12-26 20:47:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 4748 transitions. [2019-12-26 20:47:29,503 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 4748 transitions. Word has length 96 [2019-12-26 20:47:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:47:29,503 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 4748 transitions. [2019-12-26 20:47:29,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-26 20:47:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 4748 transitions. [2019-12-26 20:47:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-26 20:47:29,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:47:29,510 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 7, 7, 7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:47:29,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:47:29,719 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:47:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:47:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2067337177, now seen corresponding path program 6 times [2019-12-26 20:47:29,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:47:29,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948297586] [2019-12-26 20:47:29,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:47:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:47:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:47:29,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948297586] [2019-12-26 20:47:29,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314349340] [2019-12-26 20:47:29,910 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-26 20:47:39,039 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-26 20:47:39,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:47:39,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-26 20:47:39,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:47:39,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:39,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 437 [2019-12-26 20:47:39,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:47:39,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:39,829 WARN L192 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 38 [2019-12-26 20:47:39,830 INFO L614 ElimStorePlain]: treesize reduction 6190, result has 0.8 percent of original size [2019-12-26 20:47:39,831 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:47:39,831 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:19 [2019-12-26 20:47:39,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-26 20:47:39,903 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:39,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:39,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:47:39,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-26 20:47:39,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:47:39,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:39,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:39,995 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-26 20:47:39,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:31 [2019-12-26 20:47:40,070 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:47:40,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-26 20:47:40,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,133 INFO L614 ElimStorePlain]: treesize reduction 26, result has 63.9 percent of original size [2019-12-26 20:47:40,133 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-26 20:47:40,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:37 [2019-12-26 20:47:40,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:47:40,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-26 20:47:40,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,203 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-26 20:47:40,203 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2019-12-26 20:47:40,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-26 20:47:40,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,307 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:31 [2019-12-26 20:47:40,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-26 20:47:40,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,360 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-26 20:47:40,360 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-12-26 20:47:40,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-26 20:47:40,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,435 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-26 20:47:40,435 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:53, output treesize:27 [2019-12-26 20:47:40,519 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:47:40,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 59 [2019-12-26 20:47:40,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,571 INFO L614 ElimStorePlain]: treesize reduction 26, result has 61.8 percent of original size [2019-12-26 20:47:40,572 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-26 20:47:40,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2019-12-26 20:47:40,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:47:40,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-26 20:47:40,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,662 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-26 20:47:40,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:33 [2019-12-26 20:47:40,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-26 20:47:40,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:47:40,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:47:40,669 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-26 20:47:40,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-12-26 20:47:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 152 proven. 10 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-26 20:47:40,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:47:40,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2019-12-26 20:47:40,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906326143] [2019-12-26 20:47:40,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-26 20:47:40,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:47:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-26 20:47:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-26 20:47:40,692 INFO L87 Difference]: Start difference. First operand 2636 states and 4748 transitions. Second operand 27 states. [2019-12-26 20:47:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:47:48,680 INFO L93 Difference]: Finished difference Result 4081 states and 7338 transitions. [2019-12-26 20:47:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-26 20:47:48,680 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-12-26 20:47:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:47:48,694 INFO L225 Difference]: With dead ends: 4081 [2019-12-26 20:47:48,694 INFO L226 Difference]: Without dead ends: 4081 [2019-12-26 20:47:48,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6917 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3393, Invalid=13899, Unknown=0, NotChecked=0, Total=17292 [2019-12-26 20:47:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2019-12-26 20:47:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 2952. [2019-12-26 20:47:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-26 20:47:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 5310 transitions. [2019-12-26 20:47:48,761 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 5310 transitions. Word has length 104 [2019-12-26 20:47:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:47:48,761 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 5310 transitions. [2019-12-26 20:47:48,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-26 20:47:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 5310 transitions. [2019-12-26 20:47:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-26 20:47:48,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:47:48,768 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:47:48,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:47:48,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:47:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:47:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1776100063, now seen corresponding path program 7 times [2019-12-26 20:47:48,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:47:48,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731993135] [2019-12-26 20:47:48,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:47:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:47:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:47:49,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731993135] [2019-12-26 20:47:49,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626870372] [2019-12-26 20:47:49,194 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-26 20:47:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:47:49,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-26 20:47:49,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:47:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:47:49,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:47:49,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-26 20:47:49,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428239622] [2019-12-26 20:47:49,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 20:47:49,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:47:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 20:47:49,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:47:49,356 INFO L87 Difference]: Start difference. First operand 2952 states and 5310 transitions. Second operand 16 states. [2019-12-26 20:47:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:47:49,459 INFO L93 Difference]: Finished difference Result 3545 states and 6366 transitions. [2019-12-26 20:47:49,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 20:47:49,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2019-12-26 20:47:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:47:49,474 INFO L225 Difference]: With dead ends: 3545 [2019-12-26 20:47:49,474 INFO L226 Difference]: Without dead ends: 3545 [2019-12-26 20:47:49,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:47:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-12-26 20:47:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3268. [2019-12-26 20:47:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3268 states. [2019-12-26 20:47:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5872 transitions. [2019-12-26 20:47:49,538 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5872 transitions. Word has length 112 [2019-12-26 20:47:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:47:49,538 INFO L462 AbstractCegarLoop]: Abstraction has 3268 states and 5872 transitions. [2019-12-26 20:47:49,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 20:47:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5872 transitions. [2019-12-26 20:47:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-26 20:47:49,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:47:49,546 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:47:49,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:47:49,750 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:47:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:47:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1201731231, now seen corresponding path program 8 times [2019-12-26 20:47:49,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:47:49,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950028235] [2019-12-26 20:47:49,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:47:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:47:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:47:49,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950028235] [2019-12-26 20:47:49,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898250221] [2019-12-26 20:47:49,939 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-26 20:47:50,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:47:50,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:47:50,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-26 20:47:50,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:47:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:47:50,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:47:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-26 20:47:50,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751054759] [2019-12-26 20:47:50,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 20:47:50,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:47:50,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 20:47:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:47:50,145 INFO L87 Difference]: Start difference. First operand 3268 states and 5872 transitions. Second operand 17 states. [2019-12-26 20:47:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:47:50,243 INFO L93 Difference]: Finished difference Result 3861 states and 6928 transitions. [2019-12-26 20:47:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 20:47:50,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-12-26 20:47:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:47:50,258 INFO L225 Difference]: With dead ends: 3861 [2019-12-26 20:47:50,258 INFO L226 Difference]: Without dead ends: 3861 [2019-12-26 20:47:50,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:47:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2019-12-26 20:47:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3584. [2019-12-26 20:47:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-26 20:47:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 6434 transitions. [2019-12-26 20:47:50,318 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 6434 transitions. Word has length 120 [2019-12-26 20:47:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:47:50,318 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 6434 transitions. [2019-12-26 20:47:50,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 20:47:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 6434 transitions. [2019-12-26 20:47:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-26 20:47:50,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:47:50,326 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 9, 9, 9, 9, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:47:50,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:47:50,530 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:47:50,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:47:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 857262669, now seen corresponding path program 9 times [2019-12-26 20:47:50,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:47:50,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800875225] [2019-12-26 20:47:50,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:47:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:47:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:47:50,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800875225] [2019-12-26 20:47:50,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395042659] [2019-12-26 20:47:50,818 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-26 20:47:53,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-26 20:47:53,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:47:53,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-26 20:47:53,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:47:53,519 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 55 treesize of output 53 [2019-12-26 20:47:53,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-26 20:47:53,570 INFO L614 ElimStorePlain]: treesize reduction 30, result has 73.0 percent of original size [2019-12-26 20:47:53,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:47:53,578 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: need array sort [2019-12-26 20:47:53,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-26 20:47:53,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-12-26 20:47:53,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384604409] [2019-12-26 20:47:53,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 20:47:53,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:47:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 20:47:53,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:47:53,581 INFO L87 Difference]: Start difference. First operand 3584 states and 6434 transitions. Second operand 17 states. [2019-12-26 20:47:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-26 20:47:53,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:47:53,783 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26d73be6 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-26 20:47:53,787 INFO L168 Benchmark]: Toolchain (without parser) took 91682.61 ms. Allocated memory was 145.8 MB in the beginning and 615.5 MB in the end (delta: 469.8 MB). Free memory was 102.2 MB in the beginning and 463.7 MB in the end (delta: -361.4 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,788 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.70 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 133.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.06 ms. Allocated memory is still 202.9 MB. Free memory was 133.1 MB in the beginning and 130.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,789 INFO L168 Benchmark]: Boogie Preprocessor took 43.25 ms. Allocated memory is still 202.9 MB. Free memory was 130.4 MB in the beginning and 127.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,790 INFO L168 Benchmark]: RCFGBuilder took 740.16 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 127.8 MB in the beginning and 203.0 MB in the end (delta: -75.2 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,790 INFO L168 Benchmark]: TraceAbstraction took 89912.53 ms. Allocated memory was 236.5 MB in the beginning and 615.5 MB in the end (delta: 379.1 MB). Free memory was 203.0 MB in the beginning and 463.7 MB in the end (delta: -260.7 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. [2019-12-26 20:47:53,791 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.70 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 133.1 MB in the end (delta: -31.3 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 95.06 ms. Allocated memory is still 202.9 MB. Free memory was 133.1 MB in the beginning and 130.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.25 ms. Allocated memory is still 202.9 MB. Free memory was 130.4 MB in the beginning and 127.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 740.16 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 127.8 MB in the beginning and 203.0 MB in the end (delta: -75.2 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89912.53 ms. Allocated memory was 236.5 MB in the beginning and 615.5 MB in the end (delta: 379.1 MB). Free memory was 203.0 MB in the beginning and 463.7 MB in the end (delta: -260.7 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.9s, 196 ProgramPointsBefore, 52 ProgramPointsAfterwards, 204 TransitionsBefore, 55 TransitionsAfterwards, 9440 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 19 ConcurrentYvCompositions, 6 ChoiceCompositions, 4960 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 115 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 17748 CheckedPairsTotal, 178 TotalNumberOfCompositions - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26d73be6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26d73be6: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...