/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:58:50,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:58:50,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:58:50,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:58:50,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:58:50,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:58:50,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:58:50,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:58:50,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:58:50,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:58:50,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:58:50,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:58:50,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:58:50,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:58:50,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:58:50,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:58:50,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:58:50,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:58:50,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:58:50,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:58:50,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:58:50,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:58:50,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:58:50,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:58:50,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:58:50,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:58:50,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:58:50,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:58:50,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:58:50,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:58:50,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:58:50,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:58:50,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:58:50,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:58:50,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:58:50,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:58:50,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:58:50,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:58:50,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:58:50,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:58:50,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:58:50,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:58:50,801 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:58:50,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:58:50,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:58:50,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:58:50,803 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:58:50,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:58:50,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:58:50,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:58:50,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:58:50,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:58:50,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:58:50,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:58:50,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:58:50,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:58:50,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:58:50,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:58:50,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:58:50,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:58:50,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:58:50,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:58:50,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:58:50,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:58:50,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:58:50,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:58:50,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:58:50,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:58:50,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:58:50,807 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:58:50,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:58:50,808 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:58:50,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:58:51,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:58:51,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:58:51,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:58:51,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:58:51,153 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:58:51,155 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-27 18:58:51,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e40f47dd8/6dc3845e821a42cda95c4a0649bd6e2a/FLAGc3dc1280a [2019-12-27 18:58:51,853 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:58:51,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-27 18:58:51,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e40f47dd8/6dc3845e821a42cda95c4a0649bd6e2a/FLAGc3dc1280a [2019-12-27 18:58:52,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e40f47dd8/6dc3845e821a42cda95c4a0649bd6e2a [2019-12-27 18:58:52,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:58:52,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:58:52,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:58:52,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:58:52,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:58:52,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c869596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:52, skipping insertion in model container [2019-12-27 18:58:52,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:52" (1/1) ... [2019-12-27 18:58:52,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:58:52,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:58:52,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:58:52,929 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:58:53,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:58:53,570 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:58:53,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53 WrapperNode [2019-12-27 18:58:53,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:58:53,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:58:53,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:58:53,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:58:53,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:58:53,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:58:53,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:58:53,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:58:53,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... [2019-12-27 18:58:53,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:58:53,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:58:53,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:58:53,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:58:53,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:58:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:58:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 18:58:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 18:58:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 18:58:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:58:53,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:58:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 18:58:53,939 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 18:58:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:58:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:58:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 18:58:53,942 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:58:54,931 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:58:54,931 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 18:58:54,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:54 BoogieIcfgContainer [2019-12-27 18:58:54,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:58:54,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:58:54,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:58:54,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:58:54,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:58:52" (1/3) ... [2019-12-27 18:58:54,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c990335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:54, skipping insertion in model container [2019-12-27 18:58:54,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:53" (2/3) ... [2019-12-27 18:58:54,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c990335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:54, skipping insertion in model container [2019-12-27 18:58:54,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:54" (3/3) ... [2019-12-27 18:58:54,946 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2019-12-27 18:58:54,956 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:58:54,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:58:54,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 18:58:54,965 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:58:54,995 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,996 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,996 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,996 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,996 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,998 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,999 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,999 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,999 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:54,999 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,000 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,000 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,000 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,000 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,000 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,001 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,001 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,001 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,001 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,002 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,002 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,002 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,002 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,002 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,003 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,003 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,003 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,003 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,004 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,004 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,004 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,004 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,004 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,005 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,005 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,005 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,005 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,006 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,006 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,006 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,006 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,007 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,007 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,007 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,007 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,007 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,008 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,008 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,008 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,012 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,012 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,012 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,013 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,013 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,013 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,013 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,014 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,014 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,014 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,026 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,026 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,026 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,027 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,027 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,027 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,027 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,028 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,028 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,028 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:55,064 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 18:58:55,087 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:58:55,088 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:58:55,089 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:58:55,089 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:58:55,089 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:58:55,089 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:58:55,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:58:55,090 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:58:55,117 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions [2019-12-27 18:58:55,119 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-27 18:58:55,253 INFO L132 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-27 18:58:55,253 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 18:58:55,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 18:58:55,274 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-27 18:58:55,361 INFO L132 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-27 18:58:55,362 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 18:58:55,365 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 18:58:55,374 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2019-12-27 18:58:55,375 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:58:55,666 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:55,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:55,714 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:55,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:55,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:55,752 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:58:55,772 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:55,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:55,824 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:55,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:55,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:55,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:58:58,374 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:58,424 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:58,444 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:58,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:58,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:58,491 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:58:58,513 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:58,563 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:58,571 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:58,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:58:58,627 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:58:58,627 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:00,669 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,732 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,800 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:00,815 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,865 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:00,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:00,906 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:03,310 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:03,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:03,375 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:03,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:03,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:03,406 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:03,436 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:03,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:03,476 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:03,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:03,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:03,506 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:59:06,183 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:06,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:06,225 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:06,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:06,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:06,262 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:06,288 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:06,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:06,325 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:06,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:06,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:06,354 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:08,632 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:08,695 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:08,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,726 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2019-12-27 18:59:08,786 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:08,831 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:08,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,869 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:08,888 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:08,939 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:08,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:08,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:59:11,110 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,159 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,197 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:59:11,220 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,274 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:11,317 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:11,317 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:13,350 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:13,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:13,397 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:13,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:13,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:13,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:13,447 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:13,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:13,512 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:13,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:13,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:13,557 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:15,613 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:15,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:15,668 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:15,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:15,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:15,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:15,716 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:15,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:15,760 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:15,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:15,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:15,797 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:59:17,818 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:17,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:17,863 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:17,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:17,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:17,906 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:17,940 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:17,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:18,002 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:18,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:18,041 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:18,042 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:20,744 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:20,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:20,796 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:20,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:20,829 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:20,829 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:20,843 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:20,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:20,891 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:20,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:20,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:20,929 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:23,352 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:23,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:23,399 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:23,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:23,436 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:23,436 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:23,453 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:23,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:23,497 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:23,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:23,534 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:23,534 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:25,978 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 18:59:26,082 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:26,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:26,122 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:26,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:26,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:26,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:26,174 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:26,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:26,210 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:26,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:26,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:26,244 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:28,500 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:28,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:28,545 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:28,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:28,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:28,581 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-27 18:59:28,593 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:28,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:28,655 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:28,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:28,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:28,694 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:59:30,741 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:30,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:30,800 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:30,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:30,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:30,832 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:30,851 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:30,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:30,897 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:30,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:30,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:30,935 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:33,150 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:33,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:33,187 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:33,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:33,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:33,218 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:33,228 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:33,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:33,269 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:33,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:33,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:33,301 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:59:35,395 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:35,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:35,440 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:35,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:35,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:35,487 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:59:35,501 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:35,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:35,552 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:35,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:35,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:35,594 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:37,708 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:37,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:37,747 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:37,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:37,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:37,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:59:37,800 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:37,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:37,854 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:37,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:37,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:37,894 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-27 18:59:39,919 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:39,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:39,954 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:39,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:39,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:39,992 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:59:40,003 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,043 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,072 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-27 18:59:40,370 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,410 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,442 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-27 18:59:40,452 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,488 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,516 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,516 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 18:59:40,535 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,577 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,604 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,605 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:40,623 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,671 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:40,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:40,709 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 18:59:42,958 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:42,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:42,994 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:43,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,019 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 18:59:43,056 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:43,103 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:43,139 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,139 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 18:59:43,178 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:43,242 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:43,286 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:43,287 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 18:59:45,312 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:45,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:45,351 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:45,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:45,377 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:45,377 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:45,388 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:45,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:45,436 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:45,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:45,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:45,464 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:59:47,482 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:47,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:47,524 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:47,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:47,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:47,553 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 18:59:47,576 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:47,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:47,619 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:47,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:47,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:47,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:49,814 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:49,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:49,857 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:49,892 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:49,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:49,894 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:49,906 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:49,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:49,958 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:49,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:49,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:49,993 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:52,105 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 18:59:52,211 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 18:59:52,429 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:52,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:52,472 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:52,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:52,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:52,506 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:52,517 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:52,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:52,561 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:52,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:52,597 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:52,598 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 18:59:55,042 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 18:59:55,464 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-27 18:59:55,628 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 18:59:56,759 WARN L192 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-12-27 18:59:56,794 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:57,073 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-27 18:59:57,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:57,080 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:57,295 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 18:59:57,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 18:59:57,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 18:59:57,297 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2019-12-27 18:59:57,507 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 18:59:57,838 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-12-27 18:59:58,004 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:59:58,221 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-27 18:59:58,960 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2019-12-27 18:59:59,308 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-27 19:00:00,728 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-27 19:00:01,298 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 19:00:01,309 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5214 [2019-12-27 19:00:01,309 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2019-12-27 19:00:01,312 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 39 transitions [2019-12-27 19:00:01,337 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2019-12-27 19:00:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2019-12-27 19:00:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 19:00:01,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:01,345 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 19:00:01,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2019-12-27 19:00:01,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:01,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634255311] [2019-12-27 19:00:01,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:01,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634255311] [2019-12-27 19:00:01,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:01,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 19:00:01,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481421646] [2019-12-27 19:00:01,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:01,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:01,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 19:00:01,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:01,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:00:01,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 19:00:01,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 19:00:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:00:01,664 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2019-12-27 19:00:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:01,695 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2019-12-27 19:00:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 19:00:01,697 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 19:00:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:01,714 INFO L225 Difference]: With dead ends: 423 [2019-12-27 19:00:01,714 INFO L226 Difference]: Without dead ends: 348 [2019-12-27 19:00:01,716 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-27 19:00:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-27 19:00:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-27 19:00:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-27 19:00:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2019-12-27 19:00:01,791 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2019-12-27 19:00:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:01,791 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2019-12-27 19:00:01,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 19:00:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2019-12-27 19:00:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 19:00:01,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:01,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 19:00:01,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:01,793 INFO L82 PathProgramCache]: Analyzing trace with hash 17204672, now seen corresponding path program 1 times [2019-12-27 19:00:01,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:01,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491396835] [2019-12-27 19:00:01,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:01,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491396835] [2019-12-27 19:00:01,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:01,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:00:01,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725690727] [2019-12-27 19:00:01,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:01,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:01,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 19:00:01,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:01,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:00:01,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:00:01,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:01,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:00:01,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:00:01,998 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2019-12-27 19:00:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:02,151 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2019-12-27 19:00:02,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:00:02,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 19:00:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:02,160 INFO L225 Difference]: With dead ends: 471 [2019-12-27 19:00:02,161 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 19:00:02,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:00:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 19:00:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2019-12-27 19:00:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 19:00:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2019-12-27 19:00:02,211 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2019-12-27 19:00:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:02,212 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2019-12-27 19:00:02,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:00:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2019-12-27 19:00:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:00:02,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:02,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:00:02,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash 533344430, now seen corresponding path program 1 times [2019-12-27 19:00:02,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:02,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185337795] [2019-12-27 19:00:02,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:02,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185337795] [2019-12-27 19:00:02,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:02,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:00:02,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399802439] [2019-12-27 19:00:02,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:02,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:02,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:00:02,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:02,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:00:02,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:00:02,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:00:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:00:02,303 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2019-12-27 19:00:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:02,421 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2019-12-27 19:00:02,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:00:02,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:00:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:02,425 INFO L225 Difference]: With dead ends: 498 [2019-12-27 19:00:02,426 INFO L226 Difference]: Without dead ends: 482 [2019-12-27 19:00:02,426 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-27 19:00:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-27 19:00:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2019-12-27 19:00:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-27 19:00:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2019-12-27 19:00:02,445 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2019-12-27 19:00:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:02,446 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2019-12-27 19:00:02,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:00:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2019-12-27 19:00:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:00:02,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:02,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:00:02,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1592212615, now seen corresponding path program 1 times [2019-12-27 19:00:02,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:02,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176770021] [2019-12-27 19:00:02,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:02,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176770021] [2019-12-27 19:00:02,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:02,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:00:02,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257093523] [2019-12-27 19:00:02,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:02,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:02,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 20 transitions. [2019-12-27 19:00:02,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:02,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:00:02,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:00:02,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:00:02,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:00:02,567 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 5 states. [2019-12-27 19:00:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:02,640 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2019-12-27 19:00:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:00:02,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 19:00:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:02,641 INFO L225 Difference]: With dead ends: 114 [2019-12-27 19:00:02,641 INFO L226 Difference]: Without dead ends: 114 [2019-12-27 19:00:02,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:00:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-27 19:00:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-12-27 19:00:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-27 19:00:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 195 transitions. [2019-12-27 19:00:02,646 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 195 transitions. Word has length 10 [2019-12-27 19:00:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:02,646 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 195 transitions. [2019-12-27 19:00:02,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:00:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 195 transitions. [2019-12-27 19:00:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:02,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:02,648 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] [2019-12-27 19:00:02,648 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747938, now seen corresponding path program 1 times [2019-12-27 19:00:02,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:02,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604236370] [2019-12-27 19:00:02,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:03,218 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-12-27 19:00:03,374 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-12-27 19:00:03,537 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-12-27 19:00:03,707 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-12-27 19:00:03,870 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-27 19:00:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:04,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604236370] [2019-12-27 19:00:04,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:04,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:04,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [41384469] [2019-12-27 19:00:04,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:04,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:04,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 19:00:04,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:04,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:00:04,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:00:04,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:04,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:00:04,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:00:04,765 INFO L87 Difference]: Start difference. First operand 114 states and 195 transitions. Second operand 16 states. [2019-12-27 19:00:05,020 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 19:00:06,202 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-12-27 19:00:06,513 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-27 19:00:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:06,922 INFO L93 Difference]: Finished difference Result 146 states and 242 transitions. [2019-12-27 19:00:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:00:06,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 19:00:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:06,924 INFO L225 Difference]: With dead ends: 146 [2019-12-27 19:00:06,924 INFO L226 Difference]: Without dead ends: 146 [2019-12-27 19:00:06,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:00:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-27 19:00:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-12-27 19:00:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-27 19:00:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 242 transitions. [2019-12-27 19:00:06,929 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 242 transitions. Word has length 22 [2019-12-27 19:00:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:06,930 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 242 transitions. [2019-12-27 19:00:06,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:00:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 242 transitions. [2019-12-27 19:00:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:06,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:06,932 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] [2019-12-27 19:00:06,932 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:06,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747950, now seen corresponding path program 1 times [2019-12-27 19:00:06,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:06,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562043471] [2019-12-27 19:00:06,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:07,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562043471] [2019-12-27 19:00:07,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:07,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:00:07,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555829482] [2019-12-27 19:00:07,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:07,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:07,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 19:00:07,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:07,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:00:07,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:00:07,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:00:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:00:07,461 INFO L87 Difference]: Start difference. First operand 145 states and 242 transitions. Second operand 9 states. [2019-12-27 19:00:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:08,110 INFO L93 Difference]: Finished difference Result 203 states and 329 transitions. [2019-12-27 19:00:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:00:08,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 19:00:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:08,113 INFO L225 Difference]: With dead ends: 203 [2019-12-27 19:00:08,113 INFO L226 Difference]: Without dead ends: 170 [2019-12-27 19:00:08,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:00:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-27 19:00:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-12-27 19:00:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-27 19:00:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 228 transitions. [2019-12-27 19:00:08,118 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 228 transitions. Word has length 22 [2019-12-27 19:00:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:08,119 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 228 transitions. [2019-12-27 19:00:08,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:00:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 228 transitions. [2019-12-27 19:00:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:08,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:08,120 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] [2019-12-27 19:00:08,120 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1297988672, now seen corresponding path program 2 times [2019-12-27 19:00:08,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:08,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752230123] [2019-12-27 19:00:08,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:08,407 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-27 19:00:08,530 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-12-27 19:00:08,777 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-12-27 19:00:08,906 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-12-27 19:00:09,045 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-27 19:00:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:09,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752230123] [2019-12-27 19:00:09,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:09,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:09,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977339193] [2019-12-27 19:00:09,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:09,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:09,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 19:00:09,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:09,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:00:09,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:00:09,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:00:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:00:09,774 INFO L87 Difference]: Start difference. First operand 137 states and 228 transitions. Second operand 16 states. [2019-12-27 19:00:10,641 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-12-27 19:00:10,891 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-12-27 19:00:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:11,258 INFO L93 Difference]: Finished difference Result 171 states and 279 transitions. [2019-12-27 19:00:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:00:11,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 19:00:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:11,260 INFO L225 Difference]: With dead ends: 171 [2019-12-27 19:00:11,260 INFO L226 Difference]: Without dead ends: 140 [2019-12-27 19:00:11,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:00:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-27 19:00:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2019-12-27 19:00:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-27 19:00:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 226 transitions. [2019-12-27 19:00:11,265 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 226 transitions. Word has length 22 [2019-12-27 19:00:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:11,265 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 226 transitions. [2019-12-27 19:00:11,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:00:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 226 transitions. [2019-12-27 19:00:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:11,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:11,267 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] [2019-12-27 19:00:11,267 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 666257692, now seen corresponding path program 3 times [2019-12-27 19:00:11,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:11,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903092192] [2019-12-27 19:00:11,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:11,976 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-12-27 19:00:12,138 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-27 19:00:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:12,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903092192] [2019-12-27 19:00:12,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:12,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1296531277] [2019-12-27 19:00:12,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:12,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:12,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 56 transitions. [2019-12-27 19:00:12,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:12,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 19:00:12,964 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-27 19:00:12,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 19:00:13,145 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-27 19:00:13,521 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-27 19:00:13,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:00:13,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:00:13,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:00:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:00:13,526 INFO L87 Difference]: Start difference. First operand 136 states and 226 transitions. Second operand 19 states. [2019-12-27 19:00:14,546 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-12-27 19:00:14,866 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 43 [2019-12-27 19:00:15,304 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 46 [2019-12-27 19:00:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:15,811 INFO L93 Difference]: Finished difference Result 158 states and 255 transitions. [2019-12-27 19:00:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:00:15,811 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-27 19:00:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:15,813 INFO L225 Difference]: With dead ends: 158 [2019-12-27 19:00:15,813 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 19:00:15,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:00:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 19:00:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-12-27 19:00:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-27 19:00:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 202 transitions. [2019-12-27 19:00:15,819 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 202 transitions. Word has length 22 [2019-12-27 19:00:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:15,819 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 202 transitions. [2019-12-27 19:00:15,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:00:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 202 transitions. [2019-12-27 19:00:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:15,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:15,821 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] [2019-12-27 19:00:15,821 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -677505502, now seen corresponding path program 2 times [2019-12-27 19:00:15,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:15,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542635100] [2019-12-27 19:00:15,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:16,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542635100] [2019-12-27 19:00:16,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:16,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:00:16,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331811025] [2019-12-27 19:00:16,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:16,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:16,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 56 transitions. [2019-12-27 19:00:16,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:16,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:00:16,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:00:16,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:00:16,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:00:16,459 INFO L87 Difference]: Start difference. First operand 123 states and 202 transitions. Second operand 10 states. [2019-12-27 19:00:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:17,432 INFO L93 Difference]: Finished difference Result 134 states and 213 transitions. [2019-12-27 19:00:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:00:17,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 19:00:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:17,433 INFO L225 Difference]: With dead ends: 134 [2019-12-27 19:00:17,433 INFO L226 Difference]: Without dead ends: 109 [2019-12-27 19:00:17,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:00:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-27 19:00:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-12-27 19:00:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-27 19:00:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 174 transitions. [2019-12-27 19:00:17,437 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 174 transitions. Word has length 22 [2019-12-27 19:00:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:17,438 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 174 transitions. [2019-12-27 19:00:17,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:00:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 174 transitions. [2019-12-27 19:00:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:17,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:17,439 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] [2019-12-27 19:00:17,439 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -680803282, now seen corresponding path program 4 times [2019-12-27 19:00:17,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:17,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267220391] [2019-12-27 19:00:17,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:18,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267220391] [2019-12-27 19:00:18,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:18,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:18,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073845466] [2019-12-27 19:00:18,688 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:18,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:18,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 19:00:18,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:18,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:00:18,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:00:18,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:00:18,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:00:18,888 INFO L87 Difference]: Start difference. First operand 109 states and 174 transitions. Second operand 16 states. [2019-12-27 19:00:19,631 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 19:00:19,903 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-27 19:00:20,304 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-12-27 19:00:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:20,758 INFO L93 Difference]: Finished difference Result 120 states and 186 transitions. [2019-12-27 19:00:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:00:20,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 19:00:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:20,760 INFO L225 Difference]: With dead ends: 120 [2019-12-27 19:00:20,760 INFO L226 Difference]: Without dead ends: 103 [2019-12-27 19:00:20,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:00:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-27 19:00:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-12-27 19:00:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-27 19:00:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2019-12-27 19:00:20,764 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 22 [2019-12-27 19:00:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:20,764 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2019-12-27 19:00:20,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:00:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2019-12-27 19:00:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:20,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:20,765 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] [2019-12-27 19:00:20,765 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 382303790, now seen corresponding path program 5 times [2019-12-27 19:00:20,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:20,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86539291] [2019-12-27 19:00:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:21,128 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-12-27 19:00:21,284 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-12-27 19:00:21,463 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-12-27 19:00:21,642 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-12-27 19:00:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:22,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86539291] [2019-12-27 19:00:22,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:22,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:22,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1092207508] [2019-12-27 19:00:22,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:22,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:22,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 62 transitions. [2019-12-27 19:00:22,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:22,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:00:22,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:00:22,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:22,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:00:22,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:00:22,328 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand 15 states. [2019-12-27 19:00:22,962 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-27 19:00:23,150 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-27 19:00:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:23,667 INFO L93 Difference]: Finished difference Result 103 states and 160 transitions. [2019-12-27 19:00:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:00:23,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 19:00:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:23,668 INFO L225 Difference]: With dead ends: 103 [2019-12-27 19:00:23,668 INFO L226 Difference]: Without dead ends: 64 [2019-12-27 19:00:23,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:00:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-27 19:00:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-12-27 19:00:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 19:00:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2019-12-27 19:00:23,671 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 22 [2019-12-27 19:00:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:23,671 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2019-12-27 19:00:23,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:00:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2019-12-27 19:00:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:23,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:23,672 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] [2019-12-27 19:00:23,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1025584882, now seen corresponding path program 1 times [2019-12-27 19:00:23,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167300969] [2019-12-27 19:00:23,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:23,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167300969] [2019-12-27 19:00:23,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:23,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:00:23,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836805964] [2019-12-27 19:00:23,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:23,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:23,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 32 transitions. [2019-12-27 19:00:23,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:23,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:00:23,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:00:23,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:23,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:00:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:00:23,823 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand 6 states. [2019-12-27 19:00:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:24,090 INFO L93 Difference]: Finished difference Result 89 states and 136 transitions. [2019-12-27 19:00:24,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:00:24,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:00:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:24,091 INFO L225 Difference]: With dead ends: 89 [2019-12-27 19:00:24,092 INFO L226 Difference]: Without dead ends: 89 [2019-12-27 19:00:24,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:00:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-27 19:00:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-12-27 19:00:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-27 19:00:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-12-27 19:00:24,095 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 22 [2019-12-27 19:00:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:24,096 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-12-27 19:00:24,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:00:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-12-27 19:00:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:24,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:24,097 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] [2019-12-27 19:00:24,097 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash -524064374, now seen corresponding path program 6 times [2019-12-27 19:00:24,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:24,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646163344] [2019-12-27 19:00:24,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:24,449 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-12-27 19:00:24,570 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-27 19:00:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:25,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646163344] [2019-12-27 19:00:25,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:25,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:25,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554154383] [2019-12-27 19:00:25,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:25,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:25,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 19:00:25,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:25,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:00:25,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:00:25,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:00:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:00:25,526 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 15 states. [2019-12-27 19:00:25,888 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-12-27 19:00:26,659 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-12-27 19:00:26,904 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-12-27 19:00:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:27,255 INFO L93 Difference]: Finished difference Result 107 states and 160 transitions. [2019-12-27 19:00:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:00:27,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 19:00:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:27,256 INFO L225 Difference]: With dead ends: 107 [2019-12-27 19:00:27,256 INFO L226 Difference]: Without dead ends: 107 [2019-12-27 19:00:27,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:00:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-27 19:00:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-12-27 19:00:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-27 19:00:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2019-12-27 19:00:27,260 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 22 [2019-12-27 19:00:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:27,260 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2019-12-27 19:00:27,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:00:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2019-12-27 19:00:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:27,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:27,261 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] [2019-12-27 19:00:27,262 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -524064386, now seen corresponding path program 3 times [2019-12-27 19:00:27,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:27,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557546461] [2019-12-27 19:00:27,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:27,714 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-12-27 19:00:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:27,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557546461] [2019-12-27 19:00:27,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:27,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:00:27,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1616835615] [2019-12-27 19:00:27,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:27,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:27,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 19:00:27,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:27,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:00:27,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:00:27,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:00:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:00:27,903 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand 9 states. [2019-12-27 19:00:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:28,438 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2019-12-27 19:00:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:00:28,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 19:00:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:28,439 INFO L225 Difference]: With dead ends: 127 [2019-12-27 19:00:28,439 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 19:00:28,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:00:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 19:00:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-27 19:00:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 19:00:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2019-12-27 19:00:28,442 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 22 [2019-12-27 19:00:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:28,443 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2019-12-27 19:00:28,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:00:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2019-12-27 19:00:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:28,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:28,443 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] [2019-12-27 19:00:28,444 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:28,444 INFO L82 PathProgramCache]: Analyzing trace with hash -615135152, now seen corresponding path program 2 times [2019-12-27 19:00:28,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:28,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904053782] [2019-12-27 19:00:28,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:28,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904053782] [2019-12-27 19:00:28,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:28,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:00:28,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548302420] [2019-12-27 19:00:28,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:28,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:28,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 19:00:28,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:28,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:00:28,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:00:28,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:28,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:00:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:00:28,627 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand 6 states. [2019-12-27 19:00:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:28,968 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2019-12-27 19:00:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:00:28,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:00:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:28,970 INFO L225 Difference]: With dead ends: 69 [2019-12-27 19:00:28,970 INFO L226 Difference]: Without dead ends: 69 [2019-12-27 19:00:28,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:00:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-27 19:00:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-12-27 19:00:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-27 19:00:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2019-12-27 19:00:28,973 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 22 [2019-12-27 19:00:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:28,973 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2019-12-27 19:00:28,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:00:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2019-12-27 19:00:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:28,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:28,974 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] [2019-12-27 19:00:28,974 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash -113614644, now seen corresponding path program 7 times [2019-12-27 19:00:28,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:28,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354007028] [2019-12-27 19:00:28,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:29,193 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-27 19:00:29,308 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-12-27 19:00:29,447 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-27 19:00:29,589 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-12-27 19:00:29,773 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-12-27 19:00:29,916 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-27 19:00:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:30,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354007028] [2019-12-27 19:00:30,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:30,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:30,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693032014] [2019-12-27 19:00:30,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:30,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:30,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 19:00:30,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:30,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:00:30,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:00:30,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:30,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:00:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:00:30,568 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 15 states. [2019-12-27 19:00:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:31,824 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2019-12-27 19:00:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:00:31,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 19:00:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:31,826 INFO L225 Difference]: With dead ends: 79 [2019-12-27 19:00:31,826 INFO L226 Difference]: Without dead ends: 66 [2019-12-27 19:00:31,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:00:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-27 19:00:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-27 19:00:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-27 19:00:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2019-12-27 19:00:31,830 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2019-12-27 19:00:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:31,830 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2019-12-27 19:00:31,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:00:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2019-12-27 19:00:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:31,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:31,831 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] [2019-12-27 19:00:31,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -138827586, now seen corresponding path program 8 times [2019-12-27 19:00:31,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:31,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132562625] [2019-12-27 19:00:31,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:32,299 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-27 19:00:32,434 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-12-27 19:00:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:33,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132562625] [2019-12-27 19:00:33,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:33,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:33,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803119287] [2019-12-27 19:00:33,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:33,154 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:33,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 19:00:33,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:33,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 19:00:33,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:00:33,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:00:33,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:33,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:00:33,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:00:33,438 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 16 states. [2019-12-27 19:00:34,252 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-27 19:00:34,557 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 32 [2019-12-27 19:00:34,823 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2019-12-27 19:00:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:35,068 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-12-27 19:00:35,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:00:35,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 19:00:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:35,069 INFO L225 Difference]: With dead ends: 84 [2019-12-27 19:00:35,069 INFO L226 Difference]: Without dead ends: 72 [2019-12-27 19:00:35,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:00:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-27 19:00:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-12-27 19:00:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-27 19:00:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-12-27 19:00:35,072 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 22 [2019-12-27 19:00:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:35,072 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-12-27 19:00:35,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:00:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2019-12-27 19:00:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:35,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:35,073 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] [2019-12-27 19:00:35,073 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:35,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1653182376, now seen corresponding path program 4 times [2019-12-27 19:00:35,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:35,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11851380] [2019-12-27 19:00:35,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:35,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11851380] [2019-12-27 19:00:35,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:35,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:00:35,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811567380] [2019-12-27 19:00:35,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:35,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:35,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 19:00:35,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:35,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:00:35,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:00:35,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:35,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:00:35,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:00:35,559 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 10 states. [2019-12-27 19:00:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:36,204 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2019-12-27 19:00:36,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:00:36,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 19:00:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:36,205 INFO L225 Difference]: With dead ends: 70 [2019-12-27 19:00:36,205 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 19:00:36,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:00:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 19:00:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 19:00:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 19:00:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2019-12-27 19:00:36,207 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2019-12-27 19:00:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:36,208 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2019-12-27 19:00:36,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:00:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2019-12-27 19:00:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:36,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:36,208 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] [2019-12-27 19:00:36,208 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash 468192644, now seen corresponding path program 3 times [2019-12-27 19:00:36,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:36,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100155829] [2019-12-27 19:00:36,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:36,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100155829] [2019-12-27 19:00:36,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:36,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:00:36,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [80422771] [2019-12-27 19:00:36,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:36,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:36,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:00:36,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:36,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:00:36,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:00:36,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:00:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:00:36,461 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 8 states. [2019-12-27 19:00:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:36,919 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-12-27 19:00:36,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:00:36,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 19:00:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:36,920 INFO L225 Difference]: With dead ends: 35 [2019-12-27 19:00:36,920 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 19:00:36,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:00:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 19:00:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-27 19:00:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-27 19:00:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-12-27 19:00:36,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2019-12-27 19:00:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:36,922 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-12-27 19:00:36,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:00:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-12-27 19:00:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:36,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:36,923 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] [2019-12-27 19:00:36,923 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1814694994, now seen corresponding path program 9 times [2019-12-27 19:00:36,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:36,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922185459] [2019-12-27 19:00:36,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:37,425 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-12-27 19:00:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:38,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922185459] [2019-12-27 19:00:38,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:38,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:38,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [535021225] [2019-12-27 19:00:38,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:38,184 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:38,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions. [2019-12-27 19:00:38,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:38,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:00:38,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:00:38,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:00:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:00:38,253 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 15 states. [2019-12-27 19:00:39,032 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-27 19:00:39,214 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-27 19:00:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:39,393 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-12-27 19:00:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:00:39,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 19:00:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:39,395 INFO L225 Difference]: With dead ends: 42 [2019-12-27 19:00:39,395 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 19:00:39,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:00:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 19:00:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 19:00:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 19:00:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-12-27 19:00:39,398 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2019-12-27 19:00:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:39,398 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-12-27 19:00:39,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:00:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-12-27 19:00:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:00:39,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:00:39,399 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] [2019-12-27 19:00:39,399 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:00:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:00:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -437525002, now seen corresponding path program 10 times [2019-12-27 19:00:39,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:00:39,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502508590] [2019-12-27 19:00:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:00:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:00:39,826 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-27 19:00:39,998 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-12-27 19:00:40,131 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-27 19:00:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:00:40,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502508590] [2019-12-27 19:00:40,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:00:40,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:00:40,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039586157] [2019-12-27 19:00:40,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:00:40,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:00:40,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 19:00:40,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:00:40,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 19:00:40,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:00:40,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:00:40,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:00:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:00:40,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:00:40,992 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 16 states. [2019-12-27 19:00:41,777 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 19:00:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:00:41,939 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-12-27 19:00:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:00:41,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 19:00:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:00:41,940 INFO L225 Difference]: With dead ends: 33 [2019-12-27 19:00:41,940 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 19:00:41,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:00:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 19:00:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 19:00:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 19:00:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 19:00:41,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-27 19:00:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:00:41,942 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 19:00:41,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:00:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 19:00:41,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 19:00:41,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:00:41 BasicIcfg [2019-12-27 19:00:41,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:00:41,948 INFO L168 Benchmark]: Toolchain (without parser) took 109919.91 ms. Allocated memory was 142.6 MB in the beginning and 466.6 MB in the end (delta: 324.0 MB). Free memory was 97.2 MB in the beginning and 351.2 MB in the end (delta: -254.0 MB). Peak memory consumption was 70.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:00:41,949 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 19:00:41,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1537.02 ms. Allocated memory was 142.6 MB in the beginning and 228.6 MB in the end (delta: 86.0 MB). Free memory was 97.0 MB in the beginning and 166.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:00:41,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.39 ms. Allocated memory is still 228.6 MB. Free memory was 166.6 MB in the beginning and 163.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:00:41,950 INFO L168 Benchmark]: Boogie Preprocessor took 100.84 ms. Allocated memory is still 228.6 MB. Free memory was 163.7 MB in the beginning and 160.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:00:41,951 INFO L168 Benchmark]: RCFGBuilder took 1093.88 ms. Allocated memory is still 228.6 MB. Free memory was 160.7 MB in the beginning and 112.9 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:00:41,951 INFO L168 Benchmark]: TraceAbstraction took 107012.93 ms. Allocated memory was 228.6 MB in the beginning and 466.6 MB in the end (delta: 238.0 MB). Free memory was 112.9 MB in the beginning and 351.2 MB in the end (delta: -238.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:00:41,953 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1537.02 ms. Allocated memory was 142.6 MB in the beginning and 228.6 MB in the end (delta: 86.0 MB). Free memory was 97.0 MB in the beginning and 166.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 166.39 ms. Allocated memory is still 228.6 MB. Free memory was 166.6 MB in the beginning and 163.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.84 ms. Allocated memory is still 228.6 MB. Free memory was 163.7 MB in the beginning and 160.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1093.88 ms. Allocated memory is still 228.6 MB. Free memory was 160.7 MB in the beginning and 112.9 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107012.93 ms. Allocated memory was 228.6 MB in the beginning and 466.6 MB in the end (delta: 238.0 MB). Free memory was 112.9 MB in the beginning and 351.2 MB in the end (delta: -238.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 66.1s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 39 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 15 ConcurrentYvCompositions, 6 ChoiceCompositions, 1397 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 24 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 54.0s, 0 MoverChecksTotal, 5214 CheckedPairsTotal, 166 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 106.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 491 SDtfs, 687 SDslu, 1853 SDs, 0 SdLazy, 4252 SolverSat, 410 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 77 SyntacticMatches, 35 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 180621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...