/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.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:16:06,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:16:06,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:16:06,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:16:06,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:16:06,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:16:06,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:16:06,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:16:06,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:16:06,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:16:06,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:16:06,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:16:06,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:16:06,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:16:06,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:16:06,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:16:06,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:16:06,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:16:06,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:16:06,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:16:06,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:16:06,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:16:06,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:16:06,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:16:06,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:16:06,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:16:06,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:16:06,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:16:06,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:16:06,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:16:06,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:16:06,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:16:06,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:16:06,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:16:06,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:16:06,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:16:06,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:16:06,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:16:06,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:16:06,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:16:06,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:16:06,699 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.epf [2019-12-18 19:16:06,714 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:16:06,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:16:06,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:16:06,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:16:06,716 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:16:06,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:16:06,716 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:16:06,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:16:06,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:16:06,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:16:06,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:16:06,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:16:06,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:16:06,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:16:06,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:16:06,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:16:06,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:16:06,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:16:06,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:16:06,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:16:06,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:16:06,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:16:06,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:16:06,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:16:06,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:16:06,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:16:06,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:16:06,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:16:06,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:16:07,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:16:07,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:16:07,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:16:07,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:16:07,050 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:16:07,051 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-18 19:16:07,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95699a6dd/3407f9be82c2421d9b51709435d777a1/FLAGe6e723c68 [2019-12-18 19:16:07,727 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:16:07,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-18 19:16:07,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95699a6dd/3407f9be82c2421d9b51709435d777a1/FLAGe6e723c68 [2019-12-18 19:16:07,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95699a6dd/3407f9be82c2421d9b51709435d777a1 [2019-12-18 19:16:07,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:16:07,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:16:07,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:16:07,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:16:07,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:16:07,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:16:07" (1/1) ... [2019-12-18 19:16:07,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e2a6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:07, skipping insertion in model container [2019-12-18 19:16:07,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:16:07" (1/1) ... [2019-12-18 19:16:07,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:16:08,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:16:08,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:16:08,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:16:08,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:16:09,426 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:16:09,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09 WrapperNode [2019-12-18 19:16:09,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:16:09,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:16:09,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:16:09,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:16:09,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:16:09,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:16:09,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:16:09,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:16:09,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... [2019-12-18 19:16:09,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:16:09,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:16:09,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:16:09,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:16:09,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:16:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:16:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:16:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 19:16:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-18 19:16:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:16:09,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:16:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-18 19:16:09,674 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-18 19:16:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:16:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:16:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 19:16:09,678 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:16:10,474 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:16:10,475 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-18 19:16:10,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:16:10 BoogieIcfgContainer [2019-12-18 19:16:10,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:16:10,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:16:10,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:16:10,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:16:10,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:16:07" (1/3) ... [2019-12-18 19:16:10,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4cd0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:16:10, skipping insertion in model container [2019-12-18 19:16:10,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:16:09" (2/3) ... [2019-12-18 19:16:10,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4cd0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:16:10, skipping insertion in model container [2019-12-18 19:16:10,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:16:10" (3/3) ... [2019-12-18 19:16:10,485 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2019-12-18 19:16:10,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:16:10,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:16:10,503 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-18 19:16:10,505 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:16:10,537 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,537 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,538 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,538 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,538 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,538 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,539 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,539 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,539 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,539 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,540 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,540 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,540 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,540 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,540 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,541 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,541 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,541 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,541 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,542 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,542 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,542 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,542 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,543 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,543 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,543 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,543 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,544 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,544 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,544 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,544 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,545 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,545 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,545 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,545 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,545 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,546 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,546 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,546 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,546 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,547 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,547 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,547 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,548 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,548 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,548 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,548 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,549 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,549 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,549 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,549 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,550 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,550 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,550 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,551 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,551 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,551 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,551 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,555 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,556 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,556 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,556 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,556 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,557 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,557 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,557 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,557 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,557 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,563 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,563 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,563 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,564 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,564 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,564 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,564 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,564 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,567 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,567 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:16:10,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 19:16:10,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:16:10,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:16:10,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:16:10,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:16:10,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:16:10,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:16:10,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:16:10,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:16:10,643 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions [2019-12-18 19:16:10,645 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-18 19:16:10,752 INFO L126 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-18 19:16:10,752 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:16:10,765 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 21/193 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-18 19:16:10,774 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-18 19:16:10,857 INFO L126 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-18 19:16:10,858 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:16:10,860 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 21/193 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-18 19:16:10,866 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2019-12-18 19:16:10,867 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:16:11,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-18 19:16:11,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:11,204 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-18 19:16:11,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:11,250 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-18 19:16:11,254 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:16:11,280 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-18 19:16:11,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:11,339 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-18 19:16:11,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:11,385 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-18 19:16:11,385 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:13,812 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-18 19:16:13,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:13,866 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-18 19:16:13,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:13,896 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-18 19:16:13,896 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:16:13,917 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-18 19:16:13,956 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:13,962 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-18 19:16:13,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:13,998 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-18 19:16:13,999 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:16,051 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-18 19:16:16,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:16,101 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-18 19:16:16,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:16,130 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-18 19:16:16,131 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:16,160 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-18 19:16:16,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:16,203 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-18 19:16:16,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:16,234 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-18 19:16:16,234 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:18,620 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-18 19:16:18,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:18,670 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-18 19:16:18,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:18,704 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-18 19:16:18,705 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:18,722 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-18 19:16:18,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:18,768 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-18 19:16:18,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:18,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-18 19:16:18,799 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:16:21,378 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-18 19:16:21,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:21,415 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-18 19:16:21,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:21,451 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-18 19:16:21,451 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:21,469 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-18 19:16:21,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:21,507 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-18 19:16:21,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:21,535 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-18 19:16:21,536 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:23,812 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-18 19:16:23,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:23,853 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-18 19:16:23,884 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:23,885 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-18 19:16:23,886 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2019-12-18 19:16:23,944 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-18 19:16:23,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:23,999 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-18 19:16:24,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:24,030 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-18 19:16:24,030 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:24,050 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-18 19:16:24,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:24,093 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-18 19:16:24,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:24,129 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-18 19:16:24,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 19:16:26,266 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-18 19:16:26,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:26,316 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-18 19:16:26,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:26,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-18 19:16:26,355 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 19:16:26,369 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-18 19:16:26,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:26,419 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-18 19:16:26,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:26,455 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-18 19:16:26,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:28,489 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-18 19:16:28,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:28,532 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-18 19:16:28,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:28,568 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-18 19:16:28,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:28,581 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-18 19:16:28,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:28,624 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-18 19:16:28,657 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:28,658 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-18 19:16:28,658 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:30,704 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-18 19:16:30,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:30,755 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-18 19:16:30,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:30,795 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-18 19:16:30,795 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:30,807 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-18 19:16:30,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:30,872 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-18 19:16:30,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:30,909 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-18 19:16:30,910 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 19:16:32,927 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-18 19:16:32,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:33,006 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-18 19:16:33,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:33,051 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-18 19:16:33,051 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:33,066 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-18 19:16:33,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:33,119 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-18 19:16:33,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:33,163 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-18 19:16:33,163 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:35,796 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-18 19:16:35,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:35,843 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-18 19:16:35,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:35,882 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-18 19:16:35,883 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:35,896 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-18 19:16:35,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:35,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-18 19:16:35,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:35,972 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-18 19:16:35,972 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:38,376 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-18 19:16:38,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:38,426 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-18 19:16:38,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:38,456 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-18 19:16:38,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:38,476 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-18 19:16:38,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:38,530 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-18 19:16:38,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:38,570 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-18 19:16:38,571 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:40,969 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-18 19:16:41,090 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-18 19:16:41,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:41,127 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-18 19:16:41,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:41,155 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-18 19:16:41,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:41,173 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-18 19:16:41,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:41,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-18 19:16:41,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:41,241 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-18 19:16:41,241 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:43,484 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-18 19:16:43,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:43,526 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-18 19:16:43,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:43,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-18 19:16:43,557 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-18 19:16:43,569 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-18 19:16:43,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:43,617 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-18 19:16:43,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:43,661 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-18 19:16:43,661 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 19:16:45,706 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-18 19:16:45,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:45,743 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-18 19:16:45,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:45,769 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-18 19:16:45,770 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:45,781 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-18 19:16:45,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:45,814 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-18 19:16:45,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:45,839 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-18 19:16:45,839 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:48,036 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-18 19:16:48,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:48,081 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-18 19:16:48,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:48,119 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-18 19:16:48,119 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:48,134 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-18 19:16:48,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:48,185 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-18 19:16:48,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:48,242 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-18 19:16:48,242 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:16:50,319 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-18 19:16:50,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:50,364 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-18 19:16:50,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:50,399 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-18 19:16:50,399 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:16:50,417 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-18 19:16:50,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:50,461 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-18 19:16:50,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:50,495 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-18 19:16:50,496 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:16:52,648 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-18 19:16:52,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:52,691 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-18 19:16:52,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:52,728 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-18 19:16:52,728 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 19:16:52,742 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-18 19:16:52,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:52,790 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-18 19:16:52,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:52,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-18 19:16:52,829 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-18 19:16:54,853 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-18 19:16:54,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:54,892 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-18 19:16:54,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:54,924 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-18 19:16:54,924 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 19:16:54,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-18 19:16:54,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:54,980 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-18 19:16:55,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,009 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-18 19:16:55,010 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-18 19:16:55,304 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-18 19:16:55,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,338 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-18 19:16:55,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,386 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-18 19:16:55,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-18 19:16:55,399 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-18 19:16:55,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,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-18 19:16:55,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,469 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-18 19:16:55,470 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 19:16:55,485 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-18 19:16:55,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,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-18 19:16:55,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,555 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-18 19:16:55,556 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:55,574 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-18 19:16:55,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,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-18 19:16:55,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:55,651 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-18 19:16:55,651 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 19:16:57,894 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-18 19:16:57,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:57,929 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-18 19:16:57,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:57,954 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-18 19:16:57,955 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-18 19:16:57,994 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-18 19:16:58,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:58,042 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-18 19:16:58,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:58,084 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-18 19:16:58,084 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 19:16:58,096 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-18 19:16:58,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:58,139 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-18 19:16:58,174 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:16:58,176 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-18 19:16:58,176 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 19:17:00,197 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-18 19:17:00,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:00,247 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-18 19:17:00,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:00,285 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-18 19:17:00,286 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:17:00,302 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-18 19:17:00,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:00,352 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-18 19:17:00,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:00,388 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-18 19:17:00,388 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:17:02,403 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 19:17:02,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:02,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-18 19:17:02,466 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:02,467 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-18 19:17:02,468 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 19:17:02,485 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-18 19:17:02,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:02,533 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-18 19:17:02,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:02,565 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-18 19:17:02,566 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:17:04,720 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-18 19:17:04,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:04,762 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-18 19:17:04,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:04,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-18 19:17:04,797 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:17:04,817 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-18 19:17:04,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:04,877 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-18 19:17:04,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:04,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-18 19:17:04,936 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:17:07,060 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-18 19:17:07,169 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-18 19:17:07,377 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-18 19:17:07,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:07,421 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-18 19:17:07,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:07,452 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-18 19:17:07,452 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:17:07,463 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-18 19:17:07,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:07,501 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-18 19:17:07,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:07,536 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-18 19:17:07,536 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 19:17:10,020 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-18 19:17:10,421 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-18 19:17:10,576 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-18 19:17:11,693 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-12-18 19:17:11,705 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-18 19:17:11,935 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-18 19:17:11,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:11,942 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-18 19:17:12,158 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 19:17:12,159 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:17:12,159 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-18 19:17:12,160 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2019-12-18 19:17:12,396 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 19:17:12,734 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-12-18 19:17:12,915 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 19:17:13,133 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-18 19:17:13,837 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2019-12-18 19:17:14,105 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-18 19:17:15,227 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-18 19:17:15,668 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-18 19:17:15,677 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5214 [2019-12-18 19:17:15,678 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2019-12-18 19:17:15,681 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 39 transitions [2019-12-18 19:17:15,710 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2019-12-18 19:17:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2019-12-18 19:17:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-18 19:17:15,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:15,719 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-18 19:17:15,720 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-18 19:17:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2019-12-18 19:17:15,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:15,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902336301] [2019-12-18 19:17:15,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902336301] [2019-12-18 19:17:16,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:16,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-18 19:17:16,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822831989] [2019-12-18 19:17:16,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 19:17:16,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 19:17:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 19:17:16,060 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2019-12-18 19:17:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:16,122 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2019-12-18 19:17:16,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 19:17:16,123 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-18 19:17:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:16,149 INFO L225 Difference]: With dead ends: 423 [2019-12-18 19:17:16,149 INFO L226 Difference]: Without dead ends: 348 [2019-12-18 19:17:16,151 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-18 19:17:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-18 19:17:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-18 19:17:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 19:17:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2019-12-18 19:17:16,255 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2019-12-18 19:17:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:16,255 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2019-12-18 19:17:16,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 19:17:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2019-12-18 19:17:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 19:17:16,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:16,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 19:17:16,257 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-18 19:17:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash 17204672, now seen corresponding path program 1 times [2019-12-18 19:17:16,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:16,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037772557] [2019-12-18 19:17:16,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:16,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037772557] [2019-12-18 19:17:16,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:16,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:17:16,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823961286] [2019-12-18 19:17:16,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:17:16,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:17:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:17:16,476 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2019-12-18 19:17:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:16,627 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2019-12-18 19:17:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:17:16,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-18 19:17:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:16,638 INFO L225 Difference]: With dead ends: 471 [2019-12-18 19:17:16,638 INFO L226 Difference]: Without dead ends: 471 [2019-12-18 19:17:16,639 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-18 19:17:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-18 19:17:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2019-12-18 19:17:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-18 19:17:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2019-12-18 19:17:16,678 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2019-12-18 19:17:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:16,679 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2019-12-18 19:17:16,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:17:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2019-12-18 19:17:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:17:16,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:16,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:17:16,680 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-18 19:17:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash 533344430, now seen corresponding path program 1 times [2019-12-18 19:17:16,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:16,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948601651] [2019-12-18 19:17:16,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:16,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948601651] [2019-12-18 19:17:16,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:16,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:17:16,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740652073] [2019-12-18 19:17:16,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:17:16,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:17:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:17:16,777 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2019-12-18 19:17:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:16,891 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2019-12-18 19:17:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:17:16,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 19:17:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:16,895 INFO L225 Difference]: With dead ends: 498 [2019-12-18 19:17:16,896 INFO L226 Difference]: Without dead ends: 482 [2019-12-18 19:17:16,896 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-18 19:17:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-18 19:17:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2019-12-18 19:17:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-18 19:17:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2019-12-18 19:17:16,912 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2019-12-18 19:17:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:16,912 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2019-12-18 19:17:16,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:17:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2019-12-18 19:17:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 19:17:16,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:16,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:17:16,915 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-18 19:17:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1592212615, now seen corresponding path program 1 times [2019-12-18 19:17:16,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:16,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049171079] [2019-12-18 19:17:16,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:16,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049171079] [2019-12-18 19:17:16,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:16,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:17:16,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696500591] [2019-12-18 19:17:16,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:17:16,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:17:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:17:16,978 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2019-12-18 19:17:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:17,001 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2019-12-18 19:17:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:17:17,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-18 19:17:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:17,002 INFO L225 Difference]: With dead ends: 162 [2019-12-18 19:17:17,003 INFO L226 Difference]: Without dead ends: 162 [2019-12-18 19:17:17,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:17:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-18 19:17:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-18 19:17:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 19:17:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-18 19:17:17,007 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-18 19:17:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:17,008 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-18 19:17:17,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:17:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-18 19:17:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:17,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:17,010 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-18 19:17:17,010 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-18 19:17:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 869571194, now seen corresponding path program 1 times [2019-12-18 19:17:17,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:17,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475279673] [2019-12-18 19:17:17,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:17,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475279673] [2019-12-18 19:17:17,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:17,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:17:17,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775422766] [2019-12-18 19:17:17,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:17:17,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:17:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:17:17,178 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 5 states. [2019-12-18 19:17:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:17,449 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2019-12-18 19:17:17,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:17:17,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 19:17:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:17,451 INFO L225 Difference]: With dead ends: 206 [2019-12-18 19:17:17,451 INFO L226 Difference]: Without dead ends: 206 [2019-12-18 19:17:17,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:17:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-18 19:17:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2019-12-18 19:17:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-18 19:17:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2019-12-18 19:17:17,457 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2019-12-18 19:17:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:17,457 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2019-12-18 19:17:17,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:17:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2019-12-18 19:17:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:17,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:17,459 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-18 19:17:17,460 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-18 19:17:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1480892578, now seen corresponding path program 1 times [2019-12-18 19:17:17,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:17,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353929752] [2019-12-18 19:17:17,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:17,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353929752] [2019-12-18 19:17:17,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:17,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:17:17,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771606722] [2019-12-18 19:17:17,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:17:17,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:17:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:17:17,703 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 4 states. [2019-12-18 19:17:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:17,768 INFO L93 Difference]: Finished difference Result 222 states and 438 transitions. [2019-12-18 19:17:17,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:17:17,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 19:17:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:17,770 INFO L225 Difference]: With dead ends: 222 [2019-12-18 19:17:17,770 INFO L226 Difference]: Without dead ends: 222 [2019-12-18 19:17:17,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:17:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-18 19:17:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2019-12-18 19:17:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-18 19:17:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-18 19:17:17,776 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-18 19:17:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:17,776 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-18 19:17:17,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:17:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-18 19:17:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:17,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:17,778 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-18 19:17:17,778 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-18 19:17:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747938, now seen corresponding path program 2 times [2019-12-18 19:17:17,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:17,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106852886] [2019-12-18 19:17:17,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:18,541 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-12-18 19:17:18,846 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-18 19:17:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:19,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106852886] [2019-12-18 19:17:19,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:19,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:19,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113493566] [2019-12-18 19:17:19,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:19,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:19,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:19,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:19,396 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 14 states. [2019-12-18 19:17:20,756 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-18 19:17:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:21,248 INFO L93 Difference]: Finished difference Result 294 states and 552 transitions. [2019-12-18 19:17:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:17:21,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:21,252 INFO L225 Difference]: With dead ends: 294 [2019-12-18 19:17:21,252 INFO L226 Difference]: Without dead ends: 294 [2019-12-18 19:17:21,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:17:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-18 19:17:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 235. [2019-12-18 19:17:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-18 19:17:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 452 transitions. [2019-12-18 19:17:21,266 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 452 transitions. Word has length 22 [2019-12-18 19:17:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:21,267 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 452 transitions. [2019-12-18 19:17:21,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 452 transitions. [2019-12-18 19:17:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:21,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:21,268 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-18 19:17:21,269 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-18 19:17:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747950, now seen corresponding path program 1 times [2019-12-18 19:17:21,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:21,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973997407] [2019-12-18 19:17:21,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:21,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973997407] [2019-12-18 19:17:21,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:21,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:17:21,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229182590] [2019-12-18 19:17:21,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:17:21,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:17:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:17:21,806 INFO L87 Difference]: Start difference. First operand 235 states and 452 transitions. Second operand 8 states. [2019-12-18 19:17:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:22,410 INFO L93 Difference]: Finished difference Result 312 states and 578 transitions. [2019-12-18 19:17:22,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:17:22,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 19:17:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:22,413 INFO L225 Difference]: With dead ends: 312 [2019-12-18 19:17:22,413 INFO L226 Difference]: Without dead ends: 270 [2019-12-18 19:17:22,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:17:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-18 19:17:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 232. [2019-12-18 19:17:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-18 19:17:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 451 transitions. [2019-12-18 19:17:22,420 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 451 transitions. Word has length 22 [2019-12-18 19:17:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:22,420 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 451 transitions. [2019-12-18 19:17:22,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:17:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 451 transitions. [2019-12-18 19:17:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:22,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:22,422 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-18 19:17:22,422 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-18 19:17:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1297988672, now seen corresponding path program 3 times [2019-12-18 19:17:22,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:22,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738427305] [2019-12-18 19:17:22,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:22,733 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-18 19:17:22,900 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-12-18 19:17:23,024 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-12-18 19:17:23,160 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-12-18 19:17:23,346 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-12-18 19:17:23,553 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-18 19:17:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:24,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738427305] [2019-12-18 19:17:24,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:24,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:24,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86825170] [2019-12-18 19:17:24,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:24,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:24,108 INFO L87 Difference]: Start difference. First operand 232 states and 451 transitions. Second operand 14 states. [2019-12-18 19:17:24,986 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-12-18 19:17:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:25,708 INFO L93 Difference]: Finished difference Result 322 states and 607 transitions. [2019-12-18 19:17:25,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:17:25,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:25,715 INFO L225 Difference]: With dead ends: 322 [2019-12-18 19:17:25,715 INFO L226 Difference]: Without dead ends: 291 [2019-12-18 19:17:25,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:17:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-18 19:17:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 231. [2019-12-18 19:17:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-18 19:17:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 449 transitions. [2019-12-18 19:17:25,723 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 449 transitions. Word has length 22 [2019-12-18 19:17:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 449 transitions. [2019-12-18 19:17:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 449 transitions. [2019-12-18 19:17:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:25,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:25,724 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-18 19:17:25,724 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-18 19:17:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash 666257692, now seen corresponding path program 4 times [2019-12-18 19:17:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:25,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473069614] [2019-12-18 19:17:25,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:26,203 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-12-18 19:17:26,326 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-12-18 19:17:26,467 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-12-18 19:17:26,609 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-12-18 19:17:26,770 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2019-12-18 19:17:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:27,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473069614] [2019-12-18 19:17:27,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:27,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:27,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180952708] [2019-12-18 19:17:27,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:27,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:27,334 INFO L87 Difference]: Start difference. First operand 231 states and 449 transitions. Second operand 14 states. [2019-12-18 19:17:28,745 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-18 19:17:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:29,266 INFO L93 Difference]: Finished difference Result 348 states and 656 transitions. [2019-12-18 19:17:29,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:17:29,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:29,269 INFO L225 Difference]: With dead ends: 348 [2019-12-18 19:17:29,269 INFO L226 Difference]: Without dead ends: 318 [2019-12-18 19:17:29,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:17:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-18 19:17:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 221. [2019-12-18 19:17:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-18 19:17:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 431 transitions. [2019-12-18 19:17:29,276 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 431 transitions. Word has length 22 [2019-12-18 19:17:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:29,276 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 431 transitions. [2019-12-18 19:17:29,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 431 transitions. [2019-12-18 19:17:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:29,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:29,277 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-18 19:17:29,277 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-18 19:17:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash -677505490, now seen corresponding path program 5 times [2019-12-18 19:17:29,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:29,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233753962] [2019-12-18 19:17:29,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233753962] [2019-12-18 19:17:30,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:30,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135534030] [2019-12-18 19:17:30,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:30,464 INFO L87 Difference]: Start difference. First operand 221 states and 431 transitions. Second operand 14 states. [2019-12-18 19:17:31,853 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-18 19:17:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:32,225 INFO L93 Difference]: Finished difference Result 325 states and 624 transitions. [2019-12-18 19:17:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:17:32,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:32,227 INFO L225 Difference]: With dead ends: 325 [2019-12-18 19:17:32,227 INFO L226 Difference]: Without dead ends: 325 [2019-12-18 19:17:32,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:17:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-18 19:17:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 250. [2019-12-18 19:17:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-18 19:17:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 477 transitions. [2019-12-18 19:17:32,235 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 477 transitions. Word has length 22 [2019-12-18 19:17:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:32,235 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 477 transitions. [2019-12-18 19:17:32,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 477 transitions. [2019-12-18 19:17:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:32,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:32,236 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-18 19:17:32,236 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-18 19:17:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash -677505502, now seen corresponding path program 2 times [2019-12-18 19:17:32,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:32,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550135470] [2019-12-18 19:17:32,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:32,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-18 19:17:32,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550135470] [2019-12-18 19:17:32,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:32,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:17:32,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791921692] [2019-12-18 19:17:32,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:17:32,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:17:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:17:32,630 INFO L87 Difference]: Start difference. First operand 250 states and 477 transitions. Second operand 8 states. [2019-12-18 19:17:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:33,163 INFO L93 Difference]: Finished difference Result 351 states and 645 transitions. [2019-12-18 19:17:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:17:33,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 19:17:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:33,166 INFO L225 Difference]: With dead ends: 351 [2019-12-18 19:17:33,166 INFO L226 Difference]: Without dead ends: 326 [2019-12-18 19:17:33,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:17:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-18 19:17:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 246. [2019-12-18 19:17:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-18 19:17:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 480 transitions. [2019-12-18 19:17:33,174 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 480 transitions. Word has length 22 [2019-12-18 19:17:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:33,174 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 480 transitions. [2019-12-18 19:17:33,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:17:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 480 transitions. [2019-12-18 19:17:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:33,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:33,175 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-18 19:17:33,175 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-18 19:17:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash -680803282, now seen corresponding path program 6 times [2019-12-18 19:17:33,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:33,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360706204] [2019-12-18 19:17:33,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:33,516 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-12-18 19:17:33,666 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-12-18 19:17:33,819 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-12-18 19:17:33,944 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-12-18 19:17:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:34,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360706204] [2019-12-18 19:17:34,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:34,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:34,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573659011] [2019-12-18 19:17:34,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:34,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:34,532 INFO L87 Difference]: Start difference. First operand 246 states and 480 transitions. Second operand 14 states. [2019-12-18 19:17:35,844 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-18 19:17:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:36,250 INFO L93 Difference]: Finished difference Result 352 states and 670 transitions. [2019-12-18 19:17:36,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 19:17:36,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:36,253 INFO L225 Difference]: With dead ends: 352 [2019-12-18 19:17:36,254 INFO L226 Difference]: Without dead ends: 335 [2019-12-18 19:17:36,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:17:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-18 19:17:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 250. [2019-12-18 19:17:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-18 19:17:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 486 transitions. [2019-12-18 19:17:36,260 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 486 transitions. Word has length 22 [2019-12-18 19:17:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:36,261 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 486 transitions. [2019-12-18 19:17:36,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 486 transitions. [2019-12-18 19:17:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:36,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:36,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:17:36,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-18 19:17:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 382303790, now seen corresponding path program 7 times [2019-12-18 19:17:36,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:36,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114622696] [2019-12-18 19:17:36,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:36,627 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-12-18 19:17:36,778 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-12-18 19:17:37,038 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-12-18 19:17:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:37,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114622696] [2019-12-18 19:17:37,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:37,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:37,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999629307] [2019-12-18 19:17:37,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:37,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:37,627 INFO L87 Difference]: Start difference. First operand 250 states and 486 transitions. Second operand 14 states. [2019-12-18 19:17:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:39,051 INFO L93 Difference]: Finished difference Result 342 states and 651 transitions. [2019-12-18 19:17:39,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:17:39,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:39,053 INFO L225 Difference]: With dead ends: 342 [2019-12-18 19:17:39,053 INFO L226 Difference]: Without dead ends: 303 [2019-12-18 19:17:39,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:17:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-18 19:17:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 222. [2019-12-18 19:17:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 19:17:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 437 transitions. [2019-12-18 19:17:39,059 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 437 transitions. Word has length 22 [2019-12-18 19:17:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:39,060 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 437 transitions. [2019-12-18 19:17:39,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 437 transitions. [2019-12-18 19:17:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:39,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:39,061 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-18 19:17:39,061 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-18 19:17:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -524064374, now seen corresponding path program 8 times [2019-12-18 19:17:39,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:39,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625697162] [2019-12-18 19:17:39,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:40,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625697162] [2019-12-18 19:17:40,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:40,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:40,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114022019] [2019-12-18 19:17:40,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:40,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:40,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:40,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:40,269 INFO L87 Difference]: Start difference. First operand 222 states and 437 transitions. Second operand 14 states. [2019-12-18 19:17:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:42,293 INFO L93 Difference]: Finished difference Result 342 states and 636 transitions. [2019-12-18 19:17:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:17:42,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:42,297 INFO L225 Difference]: With dead ends: 342 [2019-12-18 19:17:42,297 INFO L226 Difference]: Without dead ends: 342 [2019-12-18 19:17:42,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:17:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-18 19:17:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 276. [2019-12-18 19:17:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-18 19:17:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 525 transitions. [2019-12-18 19:17:42,312 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 525 transitions. Word has length 22 [2019-12-18 19:17:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:42,312 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 525 transitions. [2019-12-18 19:17:42,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 525 transitions. [2019-12-18 19:17:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:42,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:42,315 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-18 19:17:42,315 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-18 19:17:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -524064386, now seen corresponding path program 3 times [2019-12-18 19:17:42,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:42,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690688454] [2019-12-18 19:17:42,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:42,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690688454] [2019-12-18 19:17:42,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:42,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:17:42,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282874659] [2019-12-18 19:17:42,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:17:42,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:17:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:17:42,990 INFO L87 Difference]: Start difference. First operand 276 states and 525 transitions. Second operand 8 states. [2019-12-18 19:17:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:43,588 INFO L93 Difference]: Finished difference Result 411 states and 748 transitions. [2019-12-18 19:17:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:17:43,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 19:17:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:43,592 INFO L225 Difference]: With dead ends: 411 [2019-12-18 19:17:43,593 INFO L226 Difference]: Without dead ends: 361 [2019-12-18 19:17:43,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:17:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-18 19:17:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 252. [2019-12-18 19:17:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-18 19:17:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 489 transitions. [2019-12-18 19:17:43,601 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 489 transitions. Word has length 22 [2019-12-18 19:17:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:43,601 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 489 transitions. [2019-12-18 19:17:43,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:17:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 489 transitions. [2019-12-18 19:17:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:43,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:43,602 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-18 19:17:43,602 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-18 19:17:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1923000708, now seen corresponding path program 9 times [2019-12-18 19:17:43,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:43,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529467731] [2019-12-18 19:17:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:43,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529467731] [2019-12-18 19:17:43,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:43,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:17:43,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758434431] [2019-12-18 19:17:43,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:17:43,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:43,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:17:43,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:17:43,779 INFO L87 Difference]: Start difference. First operand 252 states and 489 transitions. Second operand 4 states. [2019-12-18 19:17:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:43,833 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2019-12-18 19:17:43,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:17:43,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 19:17:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:43,835 INFO L225 Difference]: With dead ends: 124 [2019-12-18 19:17:43,835 INFO L226 Difference]: Without dead ends: 119 [2019-12-18 19:17:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:17:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-18 19:17:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-12-18 19:17:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-18 19:17:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2019-12-18 19:17:43,839 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 22 [2019-12-18 19:17:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:43,839 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2019-12-18 19:17:43,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:17:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2019-12-18 19:17:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:43,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:43,840 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-18 19:17:43,840 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-18 19:17:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash -615135152, now seen corresponding path program 2 times [2019-12-18 19:17:43,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:43,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620723875] [2019-12-18 19:17:43,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620723875] [2019-12-18 19:17:44,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:44,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:17:44,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075618062] [2019-12-18 19:17:44,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:17:44,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:44,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:17:44,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:17:44,033 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand 6 states. [2019-12-18 19:17:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:44,719 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2019-12-18 19:17:44,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:17:44,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 19:17:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:44,720 INFO L225 Difference]: With dead ends: 104 [2019-12-18 19:17:44,720 INFO L226 Difference]: Without dead ends: 104 [2019-12-18 19:17:44,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:17:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-18 19:17:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-12-18 19:17:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 19:17:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2019-12-18 19:17:44,725 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 22 [2019-12-18 19:17:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:44,726 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2019-12-18 19:17:44,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:17:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2019-12-18 19:17:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:44,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:44,727 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-18 19:17:44,727 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-18 19:17:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:44,728 INFO L82 PathProgramCache]: Analyzing trace with hash -113614644, now seen corresponding path program 10 times [2019-12-18 19:17:44,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:44,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081906963] [2019-12-18 19:17:44,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:45,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081906963] [2019-12-18 19:17:45,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:45,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:45,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808416216] [2019-12-18 19:17:45,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:45,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:45,964 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 14 states. [2019-12-18 19:17:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:47,298 INFO L93 Difference]: Finished difference Result 108 states and 150 transitions. [2019-12-18 19:17:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:17:47,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:47,299 INFO L225 Difference]: With dead ends: 108 [2019-12-18 19:17:47,300 INFO L226 Difference]: Without dead ends: 95 [2019-12-18 19:17:47,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:17:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-18 19:17:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-12-18 19:17:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 19:17:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2019-12-18 19:17:47,303 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 22 [2019-12-18 19:17:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:47,303 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2019-12-18 19:17:47,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2019-12-18 19:17:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:47,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:47,304 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-18 19:17:47,304 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-18 19:17:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash -138827586, now seen corresponding path program 11 times [2019-12-18 19:17:47,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:47,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024606216] [2019-12-18 19:17:47,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:48,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024606216] [2019-12-18 19:17:48,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:48,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:48,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232761919] [2019-12-18 19:17:48,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:48,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:48,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:48,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:48,433 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand 14 states. [2019-12-18 19:17:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:49,787 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2019-12-18 19:17:49,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:17:49,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:49,789 INFO L225 Difference]: With dead ends: 106 [2019-12-18 19:17:49,789 INFO L226 Difference]: Without dead ends: 94 [2019-12-18 19:17:49,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:17:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-18 19:17:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-18 19:17:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 19:17:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2019-12-18 19:17:49,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 22 [2019-12-18 19:17:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:49,793 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2019-12-18 19:17:49,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2019-12-18 19:17:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:49,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:49,793 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-18 19:17:49,794 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-18 19:17:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1653182388, now seen corresponding path program 12 times [2019-12-18 19:17:49,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:49,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890469120] [2019-12-18 19:17:49,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:50,275 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-12-18 19:17:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:50,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890469120] [2019-12-18 19:17:50,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:50,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:50,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334671562] [2019-12-18 19:17:50,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:50,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:50,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:50,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:50,997 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand 14 states. [2019-12-18 19:17:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:52,393 INFO L93 Difference]: Finished difference Result 112 states and 158 transitions. [2019-12-18 19:17:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:17:52,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:52,394 INFO L225 Difference]: With dead ends: 112 [2019-12-18 19:17:52,394 INFO L226 Difference]: Without dead ends: 112 [2019-12-18 19:17:52,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:17:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-18 19:17:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-12-18 19:17:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-18 19:17:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2019-12-18 19:17:52,399 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 22 [2019-12-18 19:17:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:52,399 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2019-12-18 19:17:52,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2019-12-18 19:17:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:52,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:52,400 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-18 19:17:52,400 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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-18 19:17:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1653182376, now seen corresponding path program 4 times [2019-12-18 19:17:52,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:52,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489577178] [2019-12-18 19:17:52,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:52,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489577178] [2019-12-18 19:17:52,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:52,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:17:52,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312429385] [2019-12-18 19:17:52,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:17:52,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:52,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:17:52,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:17:52,808 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand 8 states. [2019-12-18 19:17:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:53,193 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2019-12-18 19:17:53,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:17:53,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 19:17:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:53,194 INFO L225 Difference]: With dead ends: 113 [2019-12-18 19:17:53,194 INFO L226 Difference]: Without dead ends: 87 [2019-12-18 19:17:53,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:17:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-18 19:17:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2019-12-18 19:17:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-18 19:17:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2019-12-18 19:17:53,198 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 22 [2019-12-18 19:17:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:53,198 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2019-12-18 19:17:53,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:17:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2019-12-18 19:17:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:53,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:53,199 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-18 19:17:53,199 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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-18 19:17:53,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash 468192644, now seen corresponding path program 3 times [2019-12-18 19:17:53,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:53,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396450127] [2019-12-18 19:17:53,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:53,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396450127] [2019-12-18 19:17:53,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:53,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:17:53,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887551526] [2019-12-18 19:17:53,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:17:53,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:17:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:17:53,495 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 8 states. [2019-12-18 19:17:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:54,323 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2019-12-18 19:17:54,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:17:54,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 19:17:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:54,324 INFO L225 Difference]: With dead ends: 70 [2019-12-18 19:17:54,324 INFO L226 Difference]: Without dead ends: 70 [2019-12-18 19:17:54,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:17:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-18 19:17:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-12-18 19:17:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-18 19:17:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2019-12-18 19:17:54,326 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 22 [2019-12-18 19:17:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:54,327 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2019-12-18 19:17:54,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:17:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2019-12-18 19:17:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:54,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:54,328 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-18 19:17:54,328 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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-18 19:17:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1814694994, now seen corresponding path program 13 times [2019-12-18 19:17:54,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:54,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172703778] [2019-12-18 19:17:54,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:55,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172703778] [2019-12-18 19:17:55,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:55,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:55,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703945904] [2019-12-18 19:17:55,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:55,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:55,553 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand 14 states. [2019-12-18 19:17:56,425 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-18 19:17:56,619 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-18 19:17:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:56,813 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2019-12-18 19:17:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:17:56,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:56,813 INFO L225 Difference]: With dead ends: 77 [2019-12-18 19:17:56,814 INFO L226 Difference]: Without dead ends: 69 [2019-12-18 19:17:56,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:17:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-18 19:17:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-12-18 19:17:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-18 19:17:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2019-12-18 19:17:56,817 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 22 [2019-12-18 19:17:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:56,817 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2019-12-18 19:17:56,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2019-12-18 19:17:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:56,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:56,818 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-18 19:17:56,818 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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-18 19:17:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash -437525002, now seen corresponding path program 14 times [2019-12-18 19:17:56,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:56,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937185635] [2019-12-18 19:17:56,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:57,057 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-18 19:17:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:17:58,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937185635] [2019-12-18 19:17:58,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:17:58,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:17:58,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591004148] [2019-12-18 19:17:58,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:17:58,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:17:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:17:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:17:58,071 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 14 states. [2019-12-18 19:17:58,965 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-18 19:17:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:17:59,259 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2019-12-18 19:17:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:17:59,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:17:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:17:59,261 INFO L225 Difference]: With dead ends: 76 [2019-12-18 19:17:59,261 INFO L226 Difference]: Without dead ends: 49 [2019-12-18 19:17:59,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:17:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-18 19:17:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-12-18 19:17:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-18 19:17:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-18 19:17:59,263 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 22 [2019-12-18 19:17:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:17:59,264 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-18 19:17:59,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:17:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-12-18 19:17:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:17:59,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:17:59,264 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-18 19:17:59,265 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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-18 19:17:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:17:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 448489492, now seen corresponding path program 15 times [2019-12-18 19:17:59,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:17:59,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601374027] [2019-12-18 19:17:59,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:17:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:17:59,814 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-12-18 19:18:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:18:00,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601374027] [2019-12-18 19:18:00,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:18:00,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:18:00,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342937041] [2019-12-18 19:18:00,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:18:00,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:18:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:18:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:18:00,533 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 14 states. [2019-12-18 19:18:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:18:01,822 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-12-18 19:18:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:18:01,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:18:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:18:01,823 INFO L225 Difference]: With dead ends: 53 [2019-12-18 19:18:01,823 INFO L226 Difference]: Without dead ends: 38 [2019-12-18 19:18:01,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:18:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-18 19:18:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-18 19:18:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-18 19:18:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2019-12-18 19:18:01,825 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2019-12-18 19:18:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:18:01,825 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2019-12-18 19:18:01,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:18:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2019-12-18 19:18:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:18:01,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:18:01,826 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-18 19:18:01,826 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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-18 19:18:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:18:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 45305018, now seen corresponding path program 16 times [2019-12-18 19:18:01,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:18:01,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770439380] [2019-12-18 19:18:01,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:18:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:18:02,286 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2019-12-18 19:18:02,475 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2019-12-18 19:18:02,609 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2019-12-18 19:18:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:18:03,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770439380] [2019-12-18 19:18:03,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:18:03,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:18:03,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077420126] [2019-12-18 19:18:03,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:18:03,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:18:03,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:18:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:18:03,127 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 14 states. [2019-12-18 19:18:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:18:04,170 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-12-18 19:18:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:18:04,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-18 19:18:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:18:04,171 INFO L225 Difference]: With dead ends: 37 [2019-12-18 19:18:04,171 INFO L226 Difference]: Without dead ends: 0 [2019-12-18 19:18:04,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:18:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-18 19:18:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-18 19:18:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-18 19:18:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-18 19:18:04,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-18 19:18:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:18:04,173 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-18 19:18:04,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:18:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-18 19:18:04,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-18 19:18:04,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:18:04 BasicIcfg [2019-12-18 19:18:04,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:18:04,178 INFO L168 Benchmark]: Toolchain (without parser) took 116239.98 ms. Allocated memory was 137.9 MB in the beginning and 444.1 MB in the end (delta: 306.2 MB). Free memory was 99.3 MB in the beginning and 106.2 MB in the end (delta: -6.9 MB). Peak memory consumption was 299.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,178 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1485.87 ms. Allocated memory was 137.9 MB in the beginning and 235.4 MB in the end (delta: 97.5 MB). Free memory was 99.1 MB in the beginning and 170.8 MB in the end (delta: -71.7 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.45 ms. Allocated memory is still 235.4 MB. Free memory was 170.8 MB in the beginning and 166.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,179 INFO L168 Benchmark]: Boogie Preprocessor took 67.92 ms. Allocated memory is still 235.4 MB. Free memory was 166.3 MB in the beginning and 163.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,179 INFO L168 Benchmark]: RCFGBuilder took 870.65 ms. Allocated memory is still 235.4 MB. Free memory was 163.4 MB in the beginning and 115.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,180 INFO L168 Benchmark]: TraceAbstraction took 113699.24 ms. Allocated memory was 235.4 MB in the beginning and 444.1 MB in the end (delta: 208.7 MB). Free memory was 115.8 MB in the beginning and 106.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 218.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:18:04,181 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.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1485.87 ms. Allocated memory was 137.9 MB in the beginning and 235.4 MB in the end (delta: 97.5 MB). Free memory was 99.1 MB in the beginning and 170.8 MB in the end (delta: -71.7 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.45 ms. Allocated memory is still 235.4 MB. Free memory was 170.8 MB in the beginning and 166.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.92 ms. Allocated memory is still 235.4 MB. Free memory was 166.3 MB in the beginning and 163.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.65 ms. Allocated memory is still 235.4 MB. Free memory was 163.4 MB in the beginning and 115.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113699.24 ms. Allocated memory was 235.4 MB in the beginning and 444.1 MB in the end (delta: 208.7 MB). Free memory was 115.8 MB in the beginning and 106.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 218.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 65.0s, 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: 53.8s, 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: 113.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 710 SDtfs, 983 SDslu, 2568 SDs, 0 SdLazy, 6462 SolverSat, 444 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 24 SyntacticMatches, 47 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 27.8s 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 913 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 238413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...