/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-11 16:00:31,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-11 16:00:31,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-11 16:00:31,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-11 16:00:31,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-11 16:00:31,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-11 16:00:31,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-11 16:00:31,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-11 16:00:31,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-11 16:00:31,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-11 16:00:31,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-11 16:00:31,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-11 16:00:31,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-11 16:00:31,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-11 16:00:31,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-11 16:00:31,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-11 16:00:31,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-11 16:00:31,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-11 16:00:31,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-11 16:00:31,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-11 16:00:31,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-11 16:00:31,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-11 16:00:31,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-11 16:00:31,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-11 16:00:31,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-11 16:00:31,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-11 16:00:31,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-11 16:00:31,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-11 16:00:31,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-11 16:00:31,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-11 16:00:31,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-11 16:00:31,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-11 16:00:31,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-11 16:00:31,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-11 16:00:31,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-11 16:00:31,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-11 16:00:31,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-11 16:00:31,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-11 16:00:31,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-11 16:00:31,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-11 16:00:31,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-11 16:00:31,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-11 16:00:31,700 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-11 16:00:31,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-11 16:00:31,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-11 16:00:31,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-11 16:00:31,702 INFO L138 SettingsManager]: * Use SBE=true [2020-09-11 16:00:31,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-11 16:00:31,703 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-11 16:00:31,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-11 16:00:31,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-11 16:00:31,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-11 16:00:31,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-11 16:00:31,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-11 16:00:31,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-11 16:00:31,705 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-11 16:00:31,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-11 16:00:31,706 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-11 16:00:31,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-11 16:00:31,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-11 16:00:31,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-11 16:00:31,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-11 16:00:31,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-11 16:00:31,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 16:00:31,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-11 16:00:31,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-11 16:00:31,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-11 16:00:31,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-11 16:00:31,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-11 16:00:31,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-11 16:00:31,708 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-11 16:00:31,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-11 16:00:32,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-11 16:00:32,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-11 16:00:32,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-11 16:00:32,154 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-11 16:00:32,155 INFO L275 PluginConnector]: CDTParser initialized [2020-09-11 16:00:32,156 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-09-11 16:00:32,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/111710119/793777830c724e70b218dbe52fb047bc/FLAG1461977b0 [2020-09-11 16:00:32,917 INFO L306 CDTParser]: Found 1 translation units. [2020-09-11 16:00:32,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-09-11 16:00:32,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/111710119/793777830c724e70b218dbe52fb047bc/FLAG1461977b0 [2020-09-11 16:00:33,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/111710119/793777830c724e70b218dbe52fb047bc [2020-09-11 16:00:33,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-11 16:00:33,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-11 16:00:33,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-11 16:00:33,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-11 16:00:33,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-11 16:00:33,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 04:00:33" (1/1) ... [2020-09-11 16:00:33,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:33, skipping insertion in model container [2020-09-11 16:00:33,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 04:00:33" (1/1) ... [2020-09-11 16:00:33,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-11 16:00:33,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-11 16:00:34,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 16:00:34,077 INFO L203 MainTranslator]: Completed pre-run [2020-09-11 16:00:34,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 16:00:34,670 INFO L208 MainTranslator]: Completed translation [2020-09-11 16:00:34,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34 WrapperNode [2020-09-11 16:00:34,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-11 16:00:34,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-11 16:00:34,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-11 16:00:34,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-11 16:00:34,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-11 16:00:34,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-11 16:00:34,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-11 16:00:34,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-11 16:00:34,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... [2020-09-11 16:00:34,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-11 16:00:34,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-11 16:00:34,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-11 16:00:34,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-11 16:00:34,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-11 16:00:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-11 16:00:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-11 16:00:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-11 16:00:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-11 16:00:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-11 16:00:35,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-11 16:00:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-11 16:00:35,049 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-11 16:00:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-11 16:00:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-11 16:00:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-11 16:00:35,053 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-11 16:00:35,732 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-11 16:00:35,733 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-11 16:00:35,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 04:00:35 BoogieIcfgContainer [2020-09-11 16:00:35,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-11 16:00:35,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-11 16:00:35,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-11 16:00:35,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-11 16:00:35,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 04:00:33" (1/3) ... [2020-09-11 16:00:35,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ebf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 04:00:35, skipping insertion in model container [2020-09-11 16:00:35,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:34" (2/3) ... [2020-09-11 16:00:35,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ebf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 04:00:35, skipping insertion in model container [2020-09-11 16:00:35,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 04:00:35" (3/3) ... [2020-09-11 16:00:35,748 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-09-11 16:00:35,760 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-11 16:00:35,760 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-11 16:00:35,770 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-11 16:00:35,771 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-11 16:00:35,804 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,805 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,805 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,805 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,805 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,806 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,806 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,806 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,806 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,807 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,807 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,807 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,807 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,808 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,808 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,808 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,808 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,809 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,809 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,809 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,809 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,810 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,810 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,810 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,810 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,811 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,811 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,811 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,811 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,812 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,812 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,812 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,812 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,813 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,813 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,813 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,813 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,814 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,814 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,814 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,814 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,815 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,815 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,815 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,816 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,816 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,816 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,816 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,817 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,817 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,817 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,817 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,817 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,818 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,818 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,818 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,819 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,819 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,823 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,824 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,824 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,824 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,824 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,825 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,825 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,825 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,825 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,826 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,835 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,835 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,835 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,836 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,836 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,836 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,836 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,837 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:35,869 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-11 16:00:35,896 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 16:00:35,897 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 16:00:35,897 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 16:00:35,897 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 16:00:35,897 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 16:00:35,897 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 16:00:35,898 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 16:00:35,898 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 16:00:35,919 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-09-11 16:00:35,922 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-09-11 16:00:36,007 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-09-11 16:00:36,007 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-11 16:00:36,016 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-11 16:00:36,024 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-09-11 16:00:36,120 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-09-11 16:00:36,121 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-11 16:00:36,123 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-11 16:00:36,128 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2020-09-11 16:00:36,129 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 16:00:36,374 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:36,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:36,410 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:36,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:36,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:36,433 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:00:36,450 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:36,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:36,483 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:36,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:36,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:36,507 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:38,772 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:38,803 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:38,808 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:38,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:38,831 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:38,831 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:00:38,846 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:38,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:38,877 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:38,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:38,898 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:38,899 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:40,956 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:40,991 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:41,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:41,011 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:41,012 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:41,034 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:41,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:41,065 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:41,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:41,088 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:41,088 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:43,316 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,348 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,370 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,370 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:43,390 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,422 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,449 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,449 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:00:45,832 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:45,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:45,864 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:45,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:45,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:45,888 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:45,900 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:45,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:45,928 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:45,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:45,949 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:45,949 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:48,161 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,196 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,221 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,222 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,223 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-09-11 16:00:48,266 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,296 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,321 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,321 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:00:48,337 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,366 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,399 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,399 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-11 16:00:50,487 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:50,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:50,524 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:50,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:50,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:50,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-11 16:00:50,563 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:50,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:50,594 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:50,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:50,624 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:50,624 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:00:52,650 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,680 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,703 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,704 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:52,718 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,753 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,778 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:54,821 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:54,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:54,855 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:54,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:54,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:54,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:00:54,919 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:54,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:54,949 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:54,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:54,974 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:54,975 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-11 16:00:56,989 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:57,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:57,020 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:57,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:57,050 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:57,051 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:57,079 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:57,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:57,118 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:57,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:57,143 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:57,143 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:59,502 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:59,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:59,536 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:59,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:59,561 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:59,562 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:59,587 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:59,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:59,622 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:59,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:59,645 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:59,646 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:01,963 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:01,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:01,994 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:02,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:02,022 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:02,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:02,037 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:02,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:02,068 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:02,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:02,095 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:02,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:04,380 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-09-11 16:01:04,502 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:04,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:04,529 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:04,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:04,550 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:04,551 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:01:04,562 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:04,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:04,591 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:04,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:04,608 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:04,609 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:01:06,751 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:06,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:06,785 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:06,807 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:06,808 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:06,809 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-09-11 16:01:06,824 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:06,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:06,858 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:06,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:06,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:06,892 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-11 16:01:08,928 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:08,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:08,954 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:08,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:08,974 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:08,974 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:01:08,986 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:09,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:09,013 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:09,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:09,031 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:09,032 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:01:11,153 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:11,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:11,185 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:11,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:11,210 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:11,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:11,222 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:11,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:11,251 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:11,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:11,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:11,274 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:01:13,333 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:13,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:13,365 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:13,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:13,385 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:13,385 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:01:13,400 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:13,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:13,424 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:13,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:13,449 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:13,449 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:15,556 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:15,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:15,581 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:15,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:15,604 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:15,604 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-11 16:01:15,622 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:15,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:15,648 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:15,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:15,672 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:15,673 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-09-11 16:01:17,700 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:17,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:17,725 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:17,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:17,742 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:17,742 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-11 16:01:17,756 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:17,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:17,780 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:17,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:17,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:17,799 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-09-11 16:01:20,048 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:20,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:20,075 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:20,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:20,095 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:20,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-09-11 16:01:20,111 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:20,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:20,140 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:20,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:20,162 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:20,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-11 16:01:22,323 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:22,345 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:22,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-09-11 16:01:22,385 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:22,415 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:22,440 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,440 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-11 16:01:22,448 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:22,479 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:22,506 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:22,507 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-11 16:01:24,519 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:24,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:24,553 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:24,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:24,571 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:24,572 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:24,581 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:24,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:24,607 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:24,633 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:24,634 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:24,634 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:01:26,661 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:26,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:26,687 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:26,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:26,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:26,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-11 16:01:26,724 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:26,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:26,750 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:26,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:26,768 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:26,768 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:01:29,359 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-09-11 16:01:30,480 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-09-11 16:01:30,602 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-09-11 16:01:31,131 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-09-11 16:01:31,145 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:31,312 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-09-11 16:01:31,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:31,319 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:31,512 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-11 16:01:31,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:31,514 INFO L545 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. [2020-09-11 16:01:31,514 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-09-11 16:01:31,665 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-11 16:01:31,865 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-09-11 16:01:32,880 WARN L193 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-09-11 16:01:33,329 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-11 16:01:33,850 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-09-11 16:01:34,159 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-09-11 16:01:34,173 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5194 [2020-09-11 16:01:34,174 INFO L214 etLargeBlockEncoding]: Total number of compositions: 168 [2020-09-11 16:01:34,177 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-09-11 16:01:34,201 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-09-11 16:01:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-09-11 16:01:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-11 16:01:34,211 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:34,212 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-11 16:01:34,212 INFO L427 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]=== [2020-09-11 16:01:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-09-11 16:01:34,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:34,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40809179] [2020-09-11 16:01:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:34,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40809179] [2020-09-11 16:01:34,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:34,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-11 16:01:34,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699762097] [2020-09-11 16:01:34,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-11 16:01:34,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-11 16:01:34,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-11 16:01:34,501 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-09-11 16:01:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:34,538 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-09-11 16:01:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-11 16:01:34,543 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-11 16:01:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:34,561 INFO L225 Difference]: With dead ends: 386 [2020-09-11 16:01:34,562 INFO L226 Difference]: Without dead ends: 348 [2020-09-11 16:01:34,563 INFO L675 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 [2020-09-11 16:01:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-09-11 16:01:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-09-11 16:01:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-09-11 16:01:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-09-11 16:01:34,643 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-09-11 16:01:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:34,643 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-09-11 16:01:34,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-11 16:01:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-09-11 16:01:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-11 16:01:34,644 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:34,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-11 16:01:34,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-11 16:01:34,645 INFO L427 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]=== [2020-09-11 16:01:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-09-11 16:01:34,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:34,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843861508] [2020-09-11 16:01:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:34,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843861508] [2020-09-11 16:01:34,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:34,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 16:01:34,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587697752] [2020-09-11 16:01:34,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 16:01:34,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 16:01:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 16:01:34,944 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-09-11 16:01:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:35,065 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-09-11 16:01:35,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 16:01:35,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-11 16:01:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:35,072 INFO L225 Difference]: With dead ends: 471 [2020-09-11 16:01:35,072 INFO L226 Difference]: Without dead ends: 471 [2020-09-11 16:01:35,073 INFO L675 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 [2020-09-11 16:01:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-09-11 16:01:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-09-11 16:01:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-09-11 16:01:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-09-11 16:01:35,101 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-09-11 16:01:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:35,101 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-09-11 16:01:35,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 16:01:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-09-11 16:01:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-11 16:01:35,102 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:35,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-11 16:01:35,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-11 16:01:35,103 INFO L427 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]=== [2020-09-11 16:01:35,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-09-11 16:01:35,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:35,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909038050] [2020-09-11 16:01:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:35,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909038050] [2020-09-11 16:01:35,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:35,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 16:01:35,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173644483] [2020-09-11 16:01:35,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 16:01:35,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:35,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 16:01:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 16:01:35,234 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-09-11 16:01:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:35,323 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-09-11 16:01:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 16:01:35,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-11 16:01:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:35,329 INFO L225 Difference]: With dead ends: 498 [2020-09-11 16:01:35,329 INFO L226 Difference]: Without dead ends: 482 [2020-09-11 16:01:35,329 INFO L675 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 [2020-09-11 16:01:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-11 16:01:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-09-11 16:01:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-09-11 16:01:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-09-11 16:01:35,349 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-09-11 16:01:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:35,349 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-09-11 16:01:35,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 16:01:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-09-11 16:01:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-11 16:01:35,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:35,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:35,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-11 16:01:35,351 INFO L427 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]=== [2020-09-11 16:01:35,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-09-11 16:01:35,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:35,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228322238] [2020-09-11 16:01:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:35,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228322238] [2020-09-11 16:01:35,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:35,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 16:01:35,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137947953] [2020-09-11 16:01:35,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 16:01:35,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 16:01:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 16:01:35,483 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-09-11 16:01:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:35,496 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-09-11 16:01:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 16:01:35,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-11 16:01:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:35,498 INFO L225 Difference]: With dead ends: 162 [2020-09-11 16:01:35,498 INFO L226 Difference]: Without dead ends: 162 [2020-09-11 16:01:35,499 INFO L675 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 [2020-09-11 16:01:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-11 16:01:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-09-11 16:01:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-11 16:01:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-09-11 16:01:35,504 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-09-11 16:01:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:35,504 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-09-11 16:01:35,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 16:01:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-09-11 16:01:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:35,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:35,507 INFO L422 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] [2020-09-11 16:01:35,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-11 16:01:35,507 INFO L427 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]=== [2020-09-11 16:01:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-09-11 16:01:35,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:35,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211668482] [2020-09-11 16:01:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:35,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211668482] [2020-09-11 16:01:35,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:35,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:01:35,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521377282] [2020-09-11 16:01:35,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 16:01:35,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 16:01:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 16:01:35,753 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-09-11 16:01:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:35,917 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-09-11 16:01:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 16:01:35,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-11 16:01:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:35,919 INFO L225 Difference]: With dead ends: 206 [2020-09-11 16:01:35,919 INFO L226 Difference]: Without dead ends: 206 [2020-09-11 16:01:35,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-11 16:01:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-11 16:01:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-09-11 16:01:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-09-11 16:01:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-09-11 16:01:35,926 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-09-11 16:01:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:35,927 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-09-11 16:01:35,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 16:01:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-09-11 16:01:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:35,935 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:35,935 INFO L422 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] [2020-09-11 16:01:35,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-11 16:01:35,935 INFO L427 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]=== [2020-09-11 16:01:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-09-11 16:01:35,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:35,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974904325] [2020-09-11 16:01:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:36,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974904325] [2020-09-11 16:01:36,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:36,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:36,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651483276] [2020-09-11 16:01:36,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:36,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:36,940 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-09-11 16:01:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:38,265 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-09-11 16:01:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-11 16:01:38,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:38,270 INFO L225 Difference]: With dead ends: 314 [2020-09-11 16:01:38,270 INFO L226 Difference]: Without dead ends: 314 [2020-09-11 16:01:38,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-09-11 16:01:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-09-11 16:01:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-09-11 16:01:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-09-11 16:01:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-09-11 16:01:38,280 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-09-11 16:01:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:38,280 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-09-11 16:01:38,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-09-11 16:01:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:38,281 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:38,282 INFO L422 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] [2020-09-11 16:01:38,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-11 16:01:38,282 INFO L427 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]=== [2020-09-11 16:01:38,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-09-11 16:01:38,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:38,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322978726] [2020-09-11 16:01:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:38,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322978726] [2020-09-11 16:01:38,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:38,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 16:01:38,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249279077] [2020-09-11 16:01:38,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:38,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:38,832 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 11 states. [2020-09-11 16:01:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:39,608 INFO L93 Difference]: Finished difference Result 484 states and 900 transitions. [2020-09-11 16:01:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-11 16:01:39,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-11 16:01:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:39,611 INFO L225 Difference]: With dead ends: 484 [2020-09-11 16:01:39,611 INFO L226 Difference]: Without dead ends: 434 [2020-09-11 16:01:39,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-09-11 16:01:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-09-11 16:01:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 298. [2020-09-11 16:01:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-09-11 16:01:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 594 transitions. [2020-09-11 16:01:39,625 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 594 transitions. Word has length 22 [2020-09-11 16:01:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:39,625 INFO L479 AbstractCegarLoop]: Abstraction has 298 states and 594 transitions. [2020-09-11 16:01:39,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 594 transitions. [2020-09-11 16:01:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:39,627 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:39,627 INFO L422 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] [2020-09-11 16:01:39,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-11 16:01:39,627 INFO L427 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]=== [2020-09-11 16:01:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-09-11 16:01:39,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:39,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240433718] [2020-09-11 16:01:39,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:39,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240433718] [2020-09-11 16:01:39,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:39,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 16:01:39,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539645856] [2020-09-11 16:01:39,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-11 16:01:39,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-11 16:01:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-11 16:01:39,907 INFO L87 Difference]: Start difference. First operand 298 states and 594 transitions. Second operand 4 states. [2020-09-11 16:01:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:39,932 INFO L93 Difference]: Finished difference Result 178 states and 287 transitions. [2020-09-11 16:01:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-11 16:01:39,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-09-11 16:01:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:39,962 INFO L225 Difference]: With dead ends: 178 [2020-09-11 16:01:39,962 INFO L226 Difference]: Without dead ends: 173 [2020-09-11 16:01:39,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-11 16:01:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-09-11 16:01:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-09-11 16:01:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-11 16:01:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 282 transitions. [2020-09-11 16:01:39,968 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 282 transitions. Word has length 22 [2020-09-11 16:01:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:39,968 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 282 transitions. [2020-09-11 16:01:39,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-11 16:01:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 282 transitions. [2020-09-11 16:01:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:39,969 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:39,969 INFO L422 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] [2020-09-11 16:01:39,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-11 16:01:39,969 INFO L427 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]=== [2020-09-11 16:01:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-09-11 16:01:39,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:39,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913386807] [2020-09-11 16:01:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:40,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913386807] [2020-09-11 16:01:40,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:40,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 16:01:40,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675365886] [2020-09-11 16:01:40,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 16:01:40,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:40,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 16:01:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-11 16:01:40,237 INFO L87 Difference]: Start difference. First operand 173 states and 282 transitions. Second operand 8 states. [2020-09-11 16:01:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:40,493 INFO L93 Difference]: Finished difference Result 174 states and 275 transitions. [2020-09-11 16:01:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 16:01:40,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-11 16:01:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:40,496 INFO L225 Difference]: With dead ends: 174 [2020-09-11 16:01:40,497 INFO L226 Difference]: Without dead ends: 174 [2020-09-11 16:01:40,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-09-11 16:01:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2020-09-11 16:01:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-11 16:01:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 246 transitions. [2020-09-11 16:01:40,502 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 246 transitions. Word has length 22 [2020-09-11 16:01:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:40,503 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 246 transitions. [2020-09-11 16:01:40,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 16:01:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 246 transitions. [2020-09-11 16:01:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:40,504 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:40,504 INFO L422 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] [2020-09-11 16:01:40,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-11 16:01:40,504 INFO L427 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]=== [2020-09-11 16:01:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-09-11 16:01:40,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:40,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078962790] [2020-09-11 16:01:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:41,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078962790] [2020-09-11 16:01:41,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:41,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:41,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44976624] [2020-09-11 16:01:41,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:41,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:41,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:41,186 INFO L87 Difference]: Start difference. First operand 155 states and 246 transitions. Second operand 12 states. [2020-09-11 16:01:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:41,949 INFO L93 Difference]: Finished difference Result 167 states and 257 transitions. [2020-09-11 16:01:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:01:41,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:41,951 INFO L225 Difference]: With dead ends: 167 [2020-09-11 16:01:41,952 INFO L226 Difference]: Without dead ends: 154 [2020-09-11 16:01:41,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-09-11 16:01:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-09-11 16:01:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2020-09-11 16:01:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-09-11 16:01:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 244 transitions. [2020-09-11 16:01:41,957 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 244 transitions. Word has length 22 [2020-09-11 16:01:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:41,958 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 244 transitions. [2020-09-11 16:01:41,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 244 transitions. [2020-09-11 16:01:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:41,959 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:41,959 INFO L422 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] [2020-09-11 16:01:41,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-11 16:01:41,959 INFO L427 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]=== [2020-09-11 16:01:41,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:41,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-09-11 16:01:41,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:41,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573251900] [2020-09-11 16:01:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:42,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573251900] [2020-09-11 16:01:42,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:42,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:42,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153621543] [2020-09-11 16:01:42,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:42,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:42,604 INFO L87 Difference]: Start difference. First operand 154 states and 244 transitions. Second operand 12 states. [2020-09-11 16:01:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:43,344 INFO L93 Difference]: Finished difference Result 162 states and 251 transitions. [2020-09-11 16:01:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:43,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:43,346 INFO L225 Difference]: With dead ends: 162 [2020-09-11 16:01:43,347 INFO L226 Difference]: Without dead ends: 150 [2020-09-11 16:01:43,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-11 16:01:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-09-11 16:01:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2020-09-11 16:01:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-09-11 16:01:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 235 transitions. [2020-09-11 16:01:43,351 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 235 transitions. Word has length 22 [2020-09-11 16:01:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:43,352 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 235 transitions. [2020-09-11 16:01:43,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 235 transitions. [2020-09-11 16:01:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:43,353 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:43,353 INFO L422 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] [2020-09-11 16:01:43,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-11 16:01:43,353 INFO L427 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]=== [2020-09-11 16:01:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-09-11 16:01:43,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:43,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035999185] [2020-09-11 16:01:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:44,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035999185] [2020-09-11 16:01:44,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:44,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:44,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804976638] [2020-09-11 16:01:44,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:44,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:44,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:44,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:44,018 INFO L87 Difference]: Start difference. First operand 147 states and 235 transitions. Second operand 12 states. [2020-09-11 16:01:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:44,769 INFO L93 Difference]: Finished difference Result 170 states and 264 transitions. [2020-09-11 16:01:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:44,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:44,772 INFO L225 Difference]: With dead ends: 170 [2020-09-11 16:01:44,772 INFO L226 Difference]: Without dead ends: 170 [2020-09-11 16:01:44,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-09-11 16:01:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2020-09-11 16:01:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-09-11 16:01:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2020-09-11 16:01:44,777 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 22 [2020-09-11 16:01:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:44,778 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2020-09-11 16:01:44,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2020-09-11 16:01:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:44,779 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:44,779 INFO L422 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] [2020-09-11 16:01:44,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-11 16:01:44,779 INFO L427 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]=== [2020-09-11 16:01:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-09-11 16:01:44,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:44,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549678485] [2020-09-11 16:01:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:45,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549678485] [2020-09-11 16:01:45,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:45,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 16:01:45,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845400317] [2020-09-11 16:01:45,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:45,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:45,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:45,272 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand 11 states. [2020-09-11 16:01:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:45,964 INFO L93 Difference]: Finished difference Result 209 states and 320 transitions. [2020-09-11 16:01:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:45,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-11 16:01:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:45,965 INFO L225 Difference]: With dead ends: 209 [2020-09-11 16:01:45,965 INFO L226 Difference]: Without dead ends: 183 [2020-09-11 16:01:45,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-09-11 16:01:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-09-11 16:01:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 146. [2020-09-11 16:01:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-09-11 16:01:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 231 transitions. [2020-09-11 16:01:45,971 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 231 transitions. Word has length 22 [2020-09-11 16:01:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:45,971 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 231 transitions. [2020-09-11 16:01:45,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 231 transitions. [2020-09-11 16:01:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:45,972 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:45,972 INFO L422 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] [2020-09-11 16:01:45,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-11 16:01:45,973 INFO L427 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]=== [2020-09-11 16:01:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 3 times [2020-09-11 16:01:45,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:45,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957886038] [2020-09-11 16:01:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:46,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957886038] [2020-09-11 16:01:46,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:46,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:46,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719207609] [2020-09-11 16:01:46,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:46,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:46,332 INFO L87 Difference]: Start difference. First operand 146 states and 231 transitions. Second operand 11 states. [2020-09-11 16:01:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:47,009 INFO L93 Difference]: Finished difference Result 261 states and 414 transitions. [2020-09-11 16:01:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-11 16:01:47,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-11 16:01:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:47,012 INFO L225 Difference]: With dead ends: 261 [2020-09-11 16:01:47,012 INFO L226 Difference]: Without dead ends: 249 [2020-09-11 16:01:47,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2020-09-11 16:01:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-09-11 16:01:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 165. [2020-09-11 16:01:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-09-11 16:01:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 266 transitions. [2020-09-11 16:01:47,018 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 266 transitions. Word has length 22 [2020-09-11 16:01:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:47,018 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 266 transitions. [2020-09-11 16:01:47,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 266 transitions. [2020-09-11 16:01:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:47,019 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:47,019 INFO L422 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] [2020-09-11 16:01:47,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-11 16:01:47,020 INFO L427 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]=== [2020-09-11 16:01:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-09-11 16:01:47,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:47,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260664623] [2020-09-11 16:01:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:47,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260664623] [2020-09-11 16:01:47,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:47,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:47,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741974696] [2020-09-11 16:01:47,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:47,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:47,592 INFO L87 Difference]: Start difference. First operand 165 states and 266 transitions. Second operand 12 states. [2020-09-11 16:01:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:48,264 INFO L93 Difference]: Finished difference Result 178 states and 278 transitions. [2020-09-11 16:01:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:48,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:48,266 INFO L225 Difference]: With dead ends: 178 [2020-09-11 16:01:48,266 INFO L226 Difference]: Without dead ends: 167 [2020-09-11 16:01:48,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-09-11 16:01:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2020-09-11 16:01:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-11 16:01:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 260 transitions. [2020-09-11 16:01:48,274 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 260 transitions. Word has length 22 [2020-09-11 16:01:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:48,274 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 260 transitions. [2020-09-11 16:01:48,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2020-09-11 16:01:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:48,275 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:48,275 INFO L422 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] [2020-09-11 16:01:48,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-11 16:01:48,276 INFO L427 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]=== [2020-09-11 16:01:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-09-11 16:01:48,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:48,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109882883] [2020-09-11 16:01:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:48,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109882883] [2020-09-11 16:01:48,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:48,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:48,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766832696] [2020-09-11 16:01:48,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:48,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:48,914 INFO L87 Difference]: Start difference. First operand 163 states and 260 transitions. Second operand 12 states. [2020-09-11 16:01:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:49,612 INFO L93 Difference]: Finished difference Result 171 states and 267 transitions. [2020-09-11 16:01:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:49,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:49,613 INFO L225 Difference]: With dead ends: 171 [2020-09-11 16:01:49,613 INFO L226 Difference]: Without dead ends: 147 [2020-09-11 16:01:49,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-09-11 16:01:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2020-09-11 16:01:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-11 16:01:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 233 transitions. [2020-09-11 16:01:49,617 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 233 transitions. Word has length 22 [2020-09-11 16:01:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:49,618 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 233 transitions. [2020-09-11 16:01:49,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 233 transitions. [2020-09-11 16:01:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:49,619 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:49,619 INFO L422 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] [2020-09-11 16:01:49,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-11 16:01:49,619 INFO L427 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]=== [2020-09-11 16:01:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-09-11 16:01:49,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:49,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129654323] [2020-09-11 16:01:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:50,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129654323] [2020-09-11 16:01:50,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:50,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:50,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653244242] [2020-09-11 16:01:50,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:50,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:50,236 INFO L87 Difference]: Start difference. First operand 145 states and 233 transitions. Second operand 12 states. [2020-09-11 16:01:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:50,894 INFO L93 Difference]: Finished difference Result 152 states and 239 transitions. [2020-09-11 16:01:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:50,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:50,896 INFO L225 Difference]: With dead ends: 152 [2020-09-11 16:01:50,896 INFO L226 Difference]: Without dead ends: 152 [2020-09-11 16:01:50,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-11 16:01:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2020-09-11 16:01:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-09-11 16:01:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 239 transitions. [2020-09-11 16:01:50,901 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 239 transitions. Word has length 22 [2020-09-11 16:01:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:50,902 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 239 transitions. [2020-09-11 16:01:50,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 239 transitions. [2020-09-11 16:01:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:50,903 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:50,903 INFO L422 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] [2020-09-11 16:01:50,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-11 16:01:50,903 INFO L427 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]=== [2020-09-11 16:01:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash -149449012, now seen corresponding path program 3 times [2020-09-11 16:01:50,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:50,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54888146] [2020-09-11 16:01:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:51,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54888146] [2020-09-11 16:01:51,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:51,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 16:01:51,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455665564] [2020-09-11 16:01:51,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:51,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:51,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:51,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:51,389 INFO L87 Difference]: Start difference. First operand 151 states and 239 transitions. Second operand 11 states. [2020-09-11 16:01:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:51,942 INFO L93 Difference]: Finished difference Result 180 states and 284 transitions. [2020-09-11 16:01:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-11 16:01:51,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-11 16:01:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:51,944 INFO L225 Difference]: With dead ends: 180 [2020-09-11 16:01:51,945 INFO L226 Difference]: Without dead ends: 165 [2020-09-11 16:01:51,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-09-11 16:01:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2020-09-11 16:01:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-11 16:01:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 177 transitions. [2020-09-11 16:01:51,950 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 177 transitions. Word has length 22 [2020-09-11 16:01:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:51,950 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 177 transitions. [2020-09-11 16:01:51,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 177 transitions. [2020-09-11 16:01:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:51,951 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:51,952 INFO L422 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] [2020-09-11 16:01:51,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-11 16:01:51,952 INFO L427 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]=== [2020-09-11 16:01:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-09-11 16:01:51,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:51,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818324517] [2020-09-11 16:01:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:52,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818324517] [2020-09-11 16:01:52,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:52,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:52,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734582439] [2020-09-11 16:01:52,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:52,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:52,593 INFO L87 Difference]: Start difference. First operand 105 states and 177 transitions. Second operand 12 states. [2020-09-11 16:01:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:53,239 INFO L93 Difference]: Finished difference Result 135 states and 221 transitions. [2020-09-11 16:01:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:53,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:53,241 INFO L225 Difference]: With dead ends: 135 [2020-09-11 16:01:53,241 INFO L226 Difference]: Without dead ends: 104 [2020-09-11 16:01:53,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-09-11 16:01:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-09-11 16:01:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-09-11 16:01:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 175 transitions. [2020-09-11 16:01:53,245 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 175 transitions. Word has length 22 [2020-09-11 16:01:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:53,245 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 175 transitions. [2020-09-11 16:01:53,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 175 transitions. [2020-09-11 16:01:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:53,246 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:53,246 INFO L422 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] [2020-09-11 16:01:53,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-11 16:01:53,246 INFO L427 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]=== [2020-09-11 16:01:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-09-11 16:01:53,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:53,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907433619] [2020-09-11 16:01:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:53,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907433619] [2020-09-11 16:01:53,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:53,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:53,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795792735] [2020-09-11 16:01:53,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:53,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:53,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:53,899 INFO L87 Difference]: Start difference. First operand 104 states and 175 transitions. Second operand 12 states. [2020-09-11 16:01:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:54,597 INFO L93 Difference]: Finished difference Result 143 states and 234 transitions. [2020-09-11 16:01:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:54,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:54,600 INFO L225 Difference]: With dead ends: 143 [2020-09-11 16:01:54,601 INFO L226 Difference]: Without dead ends: 101 [2020-09-11 16:01:54,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-11 16:01:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-09-11 16:01:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-11 16:01:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 168 transitions. [2020-09-11 16:01:54,604 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 168 transitions. Word has length 22 [2020-09-11 16:01:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:54,604 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 168 transitions. [2020-09-11 16:01:54,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 168 transitions. [2020-09-11 16:01:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:54,605 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:54,605 INFO L422 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] [2020-09-11 16:01:54,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-11 16:01:54,605 INFO L427 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]=== [2020-09-11 16:01:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-09-11 16:01:54,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:54,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296033035] [2020-09-11 16:01:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:55,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296033035] [2020-09-11 16:01:55,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:55,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:55,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953017125] [2020-09-11 16:01:55,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:55,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:55,174 INFO L87 Difference]: Start difference. First operand 101 states and 168 transitions. Second operand 12 states. [2020-09-11 16:01:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:55,861 INFO L93 Difference]: Finished difference Result 153 states and 252 transitions. [2020-09-11 16:01:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:55,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:55,862 INFO L225 Difference]: With dead ends: 153 [2020-09-11 16:01:55,863 INFO L226 Difference]: Without dead ends: 116 [2020-09-11 16:01:55,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-11 16:01:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2020-09-11 16:01:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-11 16:01:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 164 transitions. [2020-09-11 16:01:55,866 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 164 transitions. Word has length 22 [2020-09-11 16:01:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:55,866 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-09-11 16:01:55,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2020-09-11 16:01:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:55,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:55,867 INFO L422 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] [2020-09-11 16:01:55,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-11 16:01:55,867 INFO L427 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]=== [2020-09-11 16:01:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-09-11 16:01:55,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:55,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688227798] [2020-09-11 16:01:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:56,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688227798] [2020-09-11 16:01:56,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:56,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:56,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951255093] [2020-09-11 16:01:56,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:56,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:56,413 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. Second operand 12 states. [2020-09-11 16:01:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:57,141 INFO L93 Difference]: Finished difference Result 136 states and 219 transitions. [2020-09-11 16:01:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:57,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:57,143 INFO L225 Difference]: With dead ends: 136 [2020-09-11 16:01:57,143 INFO L226 Difference]: Without dead ends: 106 [2020-09-11 16:01:57,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-09-11 16:01:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2020-09-11 16:01:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-11 16:01:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-09-11 16:01:57,147 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 22 [2020-09-11 16:01:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:57,147 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-09-11 16:01:57,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2020-09-11 16:01:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:57,148 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:57,148 INFO L422 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] [2020-09-11 16:01:57,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-11 16:01:57,148 INFO L427 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]=== [2020-09-11 16:01:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-09-11 16:01:57,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:57,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065555016] [2020-09-11 16:01:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:57,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065555016] [2020-09-11 16:01:57,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:57,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:57,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385320073] [2020-09-11 16:01:57,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:57,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:57,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:57,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:57,735 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand 12 states. [2020-09-11 16:01:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:58,529 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2020-09-11 16:01:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-11 16:01:58,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:58,532 INFO L225 Difference]: With dead ends: 130 [2020-09-11 16:01:58,532 INFO L226 Difference]: Without dead ends: 110 [2020-09-11 16:01:58,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-11 16:01:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-11 16:01:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-09-11 16:01:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-11 16:01:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-09-11 16:01:58,535 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 22 [2020-09-11 16:01:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:58,535 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-09-11 16:01:58,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-09-11 16:01:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:58,536 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:58,536 INFO L422 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] [2020-09-11 16:01:58,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-11 16:01:58,536 INFO L427 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]=== [2020-09-11 16:01:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-09-11 16:01:58,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:58,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31436021] [2020-09-11 16:01:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:59,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31436021] [2020-09-11 16:01:59,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:59,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:59,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5828081] [2020-09-11 16:01:59,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:59,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:59,069 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 12 states. [2020-09-11 16:01:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:59,717 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2020-09-11 16:01:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:59,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:01:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:59,719 INFO L225 Difference]: With dead ends: 120 [2020-09-11 16:01:59,719 INFO L226 Difference]: Without dead ends: 76 [2020-09-11 16:01:59,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:01:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-11 16:01:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2020-09-11 16:01:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-11 16:01:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2020-09-11 16:01:59,722 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 22 [2020-09-11 16:01:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:59,722 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-09-11 16:01:59,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2020-09-11 16:01:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 16:01:59,723 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:59,723 INFO L422 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] [2020-09-11 16:01:59,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-11 16:01:59,723 INFO L427 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]=== [2020-09-11 16:01:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-09-11 16:01:59,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:59,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687469936] [2020-09-11 16:01:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:02:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:02:00,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687469936] [2020-09-11 16:02:00,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:02:00,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:02:00,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422286056] [2020-09-11 16:02:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:02:00,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:02:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:02:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:02:00,317 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 12 states. [2020-09-11 16:02:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:02:00,976 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-09-11 16:02:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:02:00,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-11 16:02:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:02:00,977 INFO L225 Difference]: With dead ends: 66 [2020-09-11 16:02:00,977 INFO L226 Difference]: Without dead ends: 0 [2020-09-11 16:02:00,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-09-11 16:02:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-11 16:02:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-11 16:02:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-11 16:02:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-11 16:02:00,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-09-11 16:02:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:02:00,978 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-11 16:02:00,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:02:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-11 16:02:00,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-11 16:02:00,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-11 16:02:00,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 04:02:00 BasicIcfg [2020-09-11 16:02:00,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-11 16:02:00,985 INFO L168 Benchmark]: Toolchain (without parser) took 87857.22 ms. Allocated memory was 140.0 MB in the beginning and 467.1 MB in the end (delta: 327.2 MB). Free memory was 99.7 MB in the beginning and 381.3 MB in the end (delta: -281.7 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2020-09-11 16:02:00,986 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-11 16:02:00,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1535.76 ms. Allocated memory was 140.0 MB in the beginning and 238.6 MB in the end (delta: 98.6 MB). Free memory was 99.0 MB in the beginning and 172.0 MB in the end (delta: -73.0 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2020-09-11 16:02:00,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 167.25 ms. Allocated memory is still 238.6 MB. Free memory was 172.0 MB in the beginning and 167.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2020-09-11 16:02:00,987 INFO L168 Benchmark]: Boogie Preprocessor took 96.80 ms. Allocated memory is still 238.6 MB. Free memory was 167.5 MB in the beginning and 164.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-11 16:02:00,987 INFO L168 Benchmark]: RCFGBuilder took 800.51 ms. Allocated memory is still 238.6 MB. Free memory was 164.5 MB in the beginning and 117.0 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2020-09-11 16:02:00,988 INFO L168 Benchmark]: TraceAbstraction took 85243.59 ms. Allocated memory was 238.6 MB in the beginning and 467.1 MB in the end (delta: 228.6 MB). Free memory was 117.0 MB in the beginning and 381.3 MB in the end (delta: -264.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-11 16:02:00,990 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1535.76 ms. Allocated memory was 140.0 MB in the beginning and 238.6 MB in the end (delta: 98.6 MB). Free memory was 99.0 MB in the beginning and 172.0 MB in the end (delta: -73.0 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 167.25 ms. Allocated memory is still 238.6 MB. Free memory was 172.0 MB in the beginning and 167.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.80 ms. Allocated memory is still 238.6 MB. Free memory was 167.5 MB in the beginning and 164.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.51 ms. Allocated memory is still 238.6 MB. Free memory was 164.5 MB in the beginning and 117.0 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85243.59 ms. Allocated memory was 238.6 MB in the beginning and 467.1 MB in the end (delta: 228.6 MB). Free memory was 117.0 MB in the beginning and 381.3 MB in the end (delta: -264.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 58.2s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 1406 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 32 SemBasedMoverChecksNegative, 23 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 49.8s, 0 MoverChecksTotal, 5194 CheckedPairsTotal, 168 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. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 85.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 58.3s, HoareTripleCheckerStatistics: 584 SDtfs, 987 SDslu, 2060 SDs, 0 SdLazy, 4725 SolverSat, 510 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 27 SyntacticMatches, 29 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 11.4s 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, 25 MinimizatonAttempts, 559 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 482 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 186372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...