/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:58:07,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:58:07,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:58:07,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:58:07,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:58:07,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:58:07,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:58:07,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:58:07,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:58:07,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:58:07,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:58:07,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:58:07,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:58:07,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:58:07,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:58:07,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:58:07,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:58:08,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:58:08,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:58:08,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:58:08,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:58:08,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:58:08,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:58:08,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:58:08,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:58:08,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:58:08,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:58:08,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:58:08,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:58:08,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:58:08,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:58:08,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:58:08,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:58:08,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:58:08,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:58:08,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:58:08,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:58:08,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:58:08,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:58:08,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:58:08,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:58:08,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:58:08,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:58:08,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:58:08,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:58:08,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:58:08,135 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:58:08,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:58:08,136 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:58:08,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:58:08,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:58:08,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:58:08,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:58:08,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:58:08,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:58:08,140 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:58:08,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:58:08,140 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:58:08,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:58:08,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:58:08,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:58:08,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:58:08,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:58:08,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:58:08,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:58:08,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:58:08,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:58:08,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:58:08,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:58:08,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:58:08,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:58:08,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 12:58:08,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:58:08,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:58:08,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:58:08,696 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:58:08,697 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:58:08,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-11-09 12:58:08,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f4e5369/09b1d45111814d838d36b9b8319fc4e1/FLAG620e7dc81 [2020-11-09 12:58:09,565 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:58:09,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-11-09 12:58:09,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f4e5369/09b1d45111814d838d36b9b8319fc4e1/FLAG620e7dc81 [2020-11-09 12:58:09,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f4e5369/09b1d45111814d838d36b9b8319fc4e1 [2020-11-09 12:58:09,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:58:09,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:58:09,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:58:09,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:58:09,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:58:09,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:58:09" (1/1) ... [2020-11-09 12:58:09,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff895e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:09, skipping insertion in model container [2020-11-09 12:58:09,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:58:09" (1/1) ... [2020-11-09 12:58:09,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:58:09,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:58:10,014 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 12:58:10,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:58:10,728 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:58:10,747 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 12:58:10,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:58:11,321 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:58:11,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11 WrapperNode [2020-11-09 12:58:11,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:58:11,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:58:11,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:58:11,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:58:11,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:58:11,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:58:11,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:58:11,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:58:11,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... [2020-11-09 12:58:11,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:58:11,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:58:11,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:58:11,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:58:11,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:58:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:58:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:58:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:58:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 12:58:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-09 12:58:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:58:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:58:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-09 12:58:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-09 12:58:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:58:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:58:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:58:11,595 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:58:12,732 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:58:12,733 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-09 12:58:12,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:58:12 BoogieIcfgContainer [2020-11-09 12:58:12,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:58:12,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:58:12,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:58:12,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:58:12,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:58:09" (1/3) ... [2020-11-09 12:58:12,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6193f420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:58:12, skipping insertion in model container [2020-11-09 12:58:12,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:58:11" (2/3) ... [2020-11-09 12:58:12,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6193f420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:58:12, skipping insertion in model container [2020-11-09 12:58:12,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:58:12" (3/3) ... [2020-11-09 12:58:12,747 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-11-09 12:58:12,763 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:58:12,764 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:58:12,768 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-09 12:58:12,769 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:58:12,834 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,834 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,835 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,835 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,835 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,835 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,835 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,836 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,836 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,836 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,836 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,837 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,838 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,838 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,838 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,838 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,838 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,838 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,839 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,839 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,839 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,839 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,840 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,840 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,840 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,840 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,840 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,841 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,841 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,841 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,842 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,842 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,842 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,842 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,843 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,843 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,843 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,843 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,843 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,843 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,844 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,844 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,844 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,844 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,845 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,845 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,845 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,845 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,845 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,846 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,846 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,846 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,846 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,846 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,847 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,847 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,847 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,847 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,847 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,847 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,848 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,848 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,848 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,849 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,849 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,849 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,849 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,849 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,850 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,850 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,850 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,851 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,853 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,854 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,854 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,855 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,859 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,859 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,860 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:58:12,869 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-09 12:58:12,883 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-09 12:58:12,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:58:12,909 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:58:12,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:58:12,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:58:12,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:58:12,909 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:58:12,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:58:12,910 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:58:12,927 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:58:12,930 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 178 transitions, 378 flow [2020-11-09 12:58:12,934 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 178 transitions, 378 flow [2020-11-09 12:58:12,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 378 flow [2020-11-09 12:58:13,012 INFO L129 PetriNetUnfolder]: 19/226 cut-off events. [2020-11-09 12:58:13,013 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-09 12:58:13,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 226 events. 19/226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 444 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 126. Up to 4 conditions per place. [2020-11-09 12:58:13,022 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2020-11-09 12:58:15,373 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:15,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,411 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:15,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,440 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:15,441 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-11-09 12:58:15,475 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:15,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,510 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:15,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,534 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:15,534 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-09 12:58:17,744 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-09 12:58:18,183 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:18,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:18,260 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:18,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:18,308 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:18,309 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:18,334 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:18,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:18,389 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:18,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:18,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:18,432 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:20,457 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,511 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,566 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,566 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-11-09 12:58:20,594 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,660 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,738 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,739 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-11-09 12:58:20,816 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,878 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,921 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,922 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:20,944 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:20,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,997 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:21,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:21,039 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:21,042 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:23,791 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:23,825 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:23,830 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:23,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:23,863 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:23,863 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-09 12:58:23,883 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:23,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:23,932 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:23,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:23,960 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:23,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-09 12:58:25,984 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:26,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:26,036 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:26,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:26,085 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:26,086 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:26,103 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:26,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:26,154 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:26,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:26,188 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:26,188 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:28,312 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:28,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:28,366 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:28,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:28,402 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:28,402 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-11-09 12:58:28,426 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:28,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:28,470 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:28,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:28,506 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:28,507 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-11-09 12:58:30,559 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,578 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,603 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-09 12:58:30,669 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,697 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,720 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,721 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-09 12:58:30,820 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,874 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,921 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,922 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:30,922 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-11-09 12:58:30,938 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,013 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,086 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,087 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:164, output treesize:166 [2020-11-09 12:58:31,149 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,202 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,240 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:31,257 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,299 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,348 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:31,349 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:33,927 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:33,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:33,965 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:33,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:33,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:33,998 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:34,011 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:34,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:34,050 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:34,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:34,078 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:34,078 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:36,641 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:36,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:36,674 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:36,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:36,708 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:36,709 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-11-09 12:58:36,725 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:36,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:36,773 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:36,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:36,818 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:36,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:110 [2020-11-09 12:58:39,347 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-09 12:58:39,542 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-09 12:58:39,655 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:39,690 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:39,694 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:39,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:39,727 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:39,727 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-09 12:58:39,747 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:39,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:39,786 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:39,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:39,817 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:39,817 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-09 12:58:42,178 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:42,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:42,239 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:42,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:42,291 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:42,292 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:42,305 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:42,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:42,360 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:42,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:42,405 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:42,405 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:44,830 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:44,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:44,879 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:44,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:44,923 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:44,924 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-11-09 12:58:44,941 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:44,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:45,002 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:45,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:45,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:45,041 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-11-09 12:58:47,603 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:47,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:47,653 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:47,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:47,693 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:47,693 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:47,714 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:47,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:47,768 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:47,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:47,812 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:47,813 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:49,873 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:49,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:49,914 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:49,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:49,946 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:49,946 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-09 12:58:49,963 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:49,998 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:50,003 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:50,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:50,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:50,031 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-11-09 12:58:52,397 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:52,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:52,438 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:52,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:52,471 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:52,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:52,488 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:52,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:52,536 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:52,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:52,580 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:52,580 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:54,916 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,017 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 12:58:55,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,028 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,102 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,103 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:152 [2020-11-09 12:58:55,124 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,215 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,295 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:152 [2020-11-09 12:58:55,334 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,376 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,409 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,409 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:136 [2020-11-09 12:58:55,420 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,461 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:55,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:55,491 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2020-11-09 12:58:57,515 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:57,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:57,588 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:57,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:57,653 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:57,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:143 [2020-11-09 12:58:57,667 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:57,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:57,731 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:57,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:57,778 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:58:57,778 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:139, output treesize:141 [2020-11-09 12:59:00,112 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-09 12:59:00,465 WARN L194 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-11-09 12:59:00,579 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 12:59:00,820 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-11-09 12:59:00,926 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 12:59:02,036 WARN L194 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-11-09 12:59:02,045 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:02,159 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 12:59:02,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:02,165 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:02,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:02,264 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:02,264 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:135 [2020-11-09 12:59:02,673 WARN L194 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-11-09 12:59:02,681 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:02,805 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 12:59:02,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:02,813 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:02,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:02,914 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:02,915 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:135 [2020-11-09 12:59:03,027 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-09 12:59:03,440 WARN L194 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-09 12:59:03,449 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:03,601 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 12:59:03,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:03,607 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:03,717 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 12:59:03,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:03,719 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:03,719 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:144 [2020-11-09 12:59:03,846 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 12:59:04,275 WARN L194 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2020-11-09 12:59:04,290 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:04,458 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-09 12:59:04,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:04,465 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:04,588 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 12:59:04,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:04,590 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:04,590 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:175, output treesize:147 [2020-11-09 12:59:04,719 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-09 12:59:05,174 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-11-09 12:59:05,362 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:59:05,470 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:59:05,587 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:59:05,694 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:59:06,208 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-11-09 12:59:07,167 WARN L194 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-11-09 12:59:07,509 WARN L194 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-09 12:59:08,361 WARN L194 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2020-11-09 12:59:08,747 WARN L194 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-11-09 12:59:09,138 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-11-09 12:59:09,499 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2020-11-09 12:59:11,341 WARN L194 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-09 12:59:11,367 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:12,176 WARN L194 SmtUtils]: Spent 808.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-09 12:59:12,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:12,189 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:12,964 WARN L194 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 12:59:12,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:12,965 INFO L547 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-11-09 12:59:12,966 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-09 12:59:13,733 WARN L194 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 12:59:15,905 WARN L194 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 185 DAG size of output: 183 [2020-11-09 12:59:15,939 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:16,906 WARN L194 SmtUtils]: Spent 966.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-09 12:59:16,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:16,917 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 12:59:17,813 WARN L194 SmtUtils]: Spent 895.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 12:59:17,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:59:17,814 INFO L547 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-11-09 12:59:17,814 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:362, output treesize:374 [2020-11-09 12:59:18,840 WARN L194 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 12:59:19,957 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-11-09 12:59:20,454 WARN L194 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 12:59:21,741 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-09 12:59:22,333 WARN L194 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 12:59:22,339 INFO L131 LiptonReduction]: Checked pairs total: 3600 [2020-11-09 12:59:22,340 INFO L133 LiptonReduction]: Total number of compositions: 222 [2020-11-09 12:59:22,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-11-09 12:59:22,363 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 121 states. [2020-11-09 12:59:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2020-11-09 12:59:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-09 12:59:22,370 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:22,371 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-11-09 12:59:22,372 INFO L429 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-11-09 12:59:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash 688, now seen corresponding path program 1 times [2020-11-09 12:59:22,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:22,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859042331] [2020-11-09 12:59:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:22,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859042331] [2020-11-09 12:59:22,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:22,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-09 12:59:22,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253926876] [2020-11-09 12:59:22,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-09 12:59:22,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:22,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-09 12:59:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-09 12:59:22,693 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 2 states. [2020-11-09 12:59:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:22,712 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-11-09 12:59:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-09 12:59:22,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-11-09 12:59:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:22,724 INFO L225 Difference]: With dead ends: 119 [2020-11-09 12:59:22,725 INFO L226 Difference]: Without dead ends: 108 [2020-11-09 12:59:22,726 INFO L677 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-11-09 12:59:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-09 12:59:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-11-09 12:59:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-09 12:59:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 213 transitions. [2020-11-09 12:59:22,781 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 213 transitions. Word has length 1 [2020-11-09 12:59:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:22,781 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 213 transitions. [2020-11-09 12:59:22,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-09 12:59:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2020-11-09 12:59:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 12:59:22,782 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:22,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 12:59:22,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:59:22,783 INFO L429 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-11-09 12:59:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash 654434250, now seen corresponding path program 1 times [2020-11-09 12:59:22,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:22,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026799514] [2020-11-09 12:59:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:23,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026799514] [2020-11-09 12:59:23,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:23,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:59:23,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612814615] [2020-11-09 12:59:23,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:59:23,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:23,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:59:23,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:59:23,105 INFO L87 Difference]: Start difference. First operand 108 states and 213 transitions. Second operand 4 states. [2020-11-09 12:59:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:23,259 INFO L93 Difference]: Finished difference Result 146 states and 291 transitions. [2020-11-09 12:59:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:59:23,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-11-09 12:59:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:23,263 INFO L225 Difference]: With dead ends: 146 [2020-11-09 12:59:23,263 INFO L226 Difference]: Without dead ends: 146 [2020-11-09 12:59:23,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:59:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-11-09 12:59:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2020-11-09 12:59:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-09 12:59:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 263 transitions. [2020-11-09 12:59:23,283 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 263 transitions. Word has length 5 [2020-11-09 12:59:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:23,284 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 263 transitions. [2020-11-09 12:59:23,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:59:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 263 transitions. [2020-11-09 12:59:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 12:59:23,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:23,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 12:59:23,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:59:23,285 INFO L429 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-11-09 12:59:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 654434302, now seen corresponding path program 1 times [2020-11-09 12:59:23,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:23,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342148323] [2020-11-09 12:59:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:23,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342148323] [2020-11-09 12:59:23,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:23,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:59:23,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484778100] [2020-11-09 12:59:23,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:59:23,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:59:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:59:23,426 INFO L87 Difference]: Start difference. First operand 130 states and 263 transitions. Second operand 3 states. [2020-11-09 12:59:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:23,518 INFO L93 Difference]: Finished difference Result 160 states and 315 transitions. [2020-11-09 12:59:23,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:59:23,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 12:59:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:23,521 INFO L225 Difference]: With dead ends: 160 [2020-11-09 12:59:23,521 INFO L226 Difference]: Without dead ends: 153 [2020-11-09 12:59:23,521 INFO L677 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-11-09 12:59:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-11-09 12:59:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2020-11-09 12:59:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-09 12:59:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 297 transitions. [2020-11-09 12:59:23,536 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 297 transitions. Word has length 5 [2020-11-09 12:59:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:23,537 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 297 transitions. [2020-11-09 12:59:23,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:59:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 297 transitions. [2020-11-09 12:59:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 12:59:23,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:23,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:23,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:59:23,540 INFO L429 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-11-09 12:59:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1212118520, now seen corresponding path program 1 times [2020-11-09 12:59:23,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:23,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133432939] [2020-11-09 12:59:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:23,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133432939] [2020-11-09 12:59:23,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:23,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:59:23,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920841580] [2020-11-09 12:59:23,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:59:23,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:59:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:59:23,650 INFO L87 Difference]: Start difference. First operand 145 states and 297 transitions. Second operand 3 states. [2020-11-09 12:59:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:23,672 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2020-11-09 12:59:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:59:23,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 12:59:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:23,675 INFO L225 Difference]: With dead ends: 57 [2020-11-09 12:59:23,676 INFO L226 Difference]: Without dead ends: 57 [2020-11-09 12:59:23,679 INFO L677 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-11-09 12:59:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-09 12:59:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-09 12:59:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 12:59:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2020-11-09 12:59:23,687 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 10 [2020-11-09 12:59:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:23,687 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2020-11-09 12:59:23,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:59:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-11-09 12:59:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:23,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:23,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:23,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:59:23,692 INFO L429 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-11-09 12:59:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590593, now seen corresponding path program 1 times [2020-11-09 12:59:23,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:23,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761693501] [2020-11-09 12:59:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:24,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761693501] [2020-11-09 12:59:24,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:24,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:59:24,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192495888] [2020-11-09 12:59:24,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:59:24,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:59:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:59:24,154 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand 7 states. [2020-11-09 12:59:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:24,548 INFO L93 Difference]: Finished difference Result 98 states and 161 transitions. [2020-11-09 12:59:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:24,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 12:59:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:24,550 INFO L225 Difference]: With dead ends: 98 [2020-11-09 12:59:24,550 INFO L226 Difference]: Without dead ends: 98 [2020-11-09 12:59:24,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:59:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-09 12:59:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2020-11-09 12:59:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-09 12:59:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 124 transitions. [2020-11-09 12:59:24,565 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 124 transitions. Word has length 16 [2020-11-09 12:59:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:24,565 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 124 transitions. [2020-11-09 12:59:24,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:59:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 124 transitions. [2020-11-09 12:59:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:24,568 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:24,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:24,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:59:24,569 INFO L429 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-11-09 12:59:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590631, now seen corresponding path program 1 times [2020-11-09 12:59:24,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:24,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270250826] [2020-11-09 12:59:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:25,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270250826] [2020-11-09 12:59:25,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:25,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:25,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513071840] [2020-11-09 12:59:25,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:25,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:25,368 INFO L87 Difference]: Start difference. First operand 74 states and 124 transitions. Second operand 10 states. [2020-11-09 12:59:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:25,863 INFO L93 Difference]: Finished difference Result 88 states and 141 transitions. [2020-11-09 12:59:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:25,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:25,865 INFO L225 Difference]: With dead ends: 88 [2020-11-09 12:59:25,866 INFO L226 Difference]: Without dead ends: 77 [2020-11-09 12:59:25,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-09 12:59:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-11-09 12:59:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-09 12:59:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2020-11-09 12:59:25,871 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 16 [2020-11-09 12:59:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:25,872 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2020-11-09 12:59:25,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2020-11-09 12:59:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:25,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:25,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:25,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:59:25,873 INFO L429 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-11-09 12:59:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1365975115, now seen corresponding path program 2 times [2020-11-09 12:59:25,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:25,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989971742] [2020-11-09 12:59:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:26,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989971742] [2020-11-09 12:59:26,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:26,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:26,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751620195] [2020-11-09 12:59:26,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:26,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:26,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:26,730 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 10 states. [2020-11-09 12:59:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:27,309 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2020-11-09 12:59:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:59:27,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:27,311 INFO L225 Difference]: With dead ends: 77 [2020-11-09 12:59:27,311 INFO L226 Difference]: Without dead ends: 62 [2020-11-09 12:59:27,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-09 12:59:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2020-11-09 12:59:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 12:59:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2020-11-09 12:59:27,315 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 16 [2020-11-09 12:59:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:27,315 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2020-11-09 12:59:27,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2020-11-09 12:59:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:27,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:27,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:27,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:59:27,317 INFO L429 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-11-09 12:59:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504767, now seen corresponding path program 2 times [2020-11-09 12:59:27,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:27,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458879132] [2020-11-09 12:59:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:27,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458879132] [2020-11-09 12:59:27,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:27,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:59:27,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949714258] [2020-11-09 12:59:27,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:59:27,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:27,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:59:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:59:27,614 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 7 states. [2020-11-09 12:59:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:28,005 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-11-09 12:59:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:59:28,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 12:59:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:28,007 INFO L225 Difference]: With dead ends: 86 [2020-11-09 12:59:28,007 INFO L226 Difference]: Without dead ends: 86 [2020-11-09 12:59:28,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:59:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-09 12:59:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2020-11-09 12:59:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-09 12:59:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 116 transitions. [2020-11-09 12:59:28,013 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 116 transitions. Word has length 16 [2020-11-09 12:59:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:28,013 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 116 transitions. [2020-11-09 12:59:28,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:59:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 116 transitions. [2020-11-09 12:59:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:28,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:28,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:28,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:59:28,015 INFO L429 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-11-09 12:59:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504729, now seen corresponding path program 3 times [2020-11-09 12:59:28,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:28,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627584558] [2020-11-09 12:59:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:28,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627584558] [2020-11-09 12:59:28,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:28,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:28,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152635596] [2020-11-09 12:59:28,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:28,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:28,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:28,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:28,677 INFO L87 Difference]: Start difference. First operand 70 states and 116 transitions. Second operand 10 states. [2020-11-09 12:59:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:29,193 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2020-11-09 12:59:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:29,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:29,194 INFO L225 Difference]: With dead ends: 91 [2020-11-09 12:59:29,195 INFO L226 Difference]: Without dead ends: 70 [2020-11-09 12:59:29,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-09 12:59:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-11-09 12:59:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-09 12:59:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-11-09 12:59:29,199 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 16 [2020-11-09 12:59:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:29,199 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-11-09 12:59:29,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-11-09 12:59:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:29,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:29,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:29,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:59:29,200 INFO L429 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-11-09 12:59:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756409, now seen corresponding path program 3 times [2020-11-09 12:59:29,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:29,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684627280] [2020-11-09 12:59:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:29,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684627280] [2020-11-09 12:59:29,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:29,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:59:29,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136118573] [2020-11-09 12:59:29,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:59:29,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:59:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:59:29,659 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 9 states. [2020-11-09 12:59:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:30,313 INFO L93 Difference]: Finished difference Result 118 states and 181 transitions. [2020-11-09 12:59:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:59:30,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 12:59:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:30,316 INFO L225 Difference]: With dead ends: 118 [2020-11-09 12:59:30,316 INFO L226 Difference]: Without dead ends: 118 [2020-11-09 12:59:30,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:59:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-09 12:59:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2020-11-09 12:59:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 12:59:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 128 transitions. [2020-11-09 12:59:30,321 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 128 transitions. Word has length 16 [2020-11-09 12:59:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:30,321 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 128 transitions. [2020-11-09 12:59:30,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:59:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 128 transitions. [2020-11-09 12:59:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:30,322 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:30,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:30,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:59:30,323 INFO L429 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-11-09 12:59:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756371, now seen corresponding path program 4 times [2020-11-09 12:59:30,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:30,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861149684] [2020-11-09 12:59:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:30,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861149684] [2020-11-09 12:59:30,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:30,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:30,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882170784] [2020-11-09 12:59:30,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:30,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:30,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:30,891 INFO L87 Difference]: Start difference. First operand 77 states and 128 transitions. Second operand 10 states. [2020-11-09 12:59:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:31,309 INFO L93 Difference]: Finished difference Result 110 states and 181 transitions. [2020-11-09 12:59:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:31,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:31,311 INFO L225 Difference]: With dead ends: 110 [2020-11-09 12:59:31,311 INFO L226 Difference]: Without dead ends: 99 [2020-11-09 12:59:31,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-09 12:59:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2020-11-09 12:59:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-09 12:59:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2020-11-09 12:59:31,317 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 16 [2020-11-09 12:59:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:31,317 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2020-11-09 12:59:31,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2020-11-09 12:59:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:31,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:31,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:31,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:59:31,318 INFO L429 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-11-09 12:59:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash 330645179, now seen corresponding path program 5 times [2020-11-09 12:59:31,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:31,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219314900] [2020-11-09 12:59:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:31,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219314900] [2020-11-09 12:59:31,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:31,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:31,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096807280] [2020-11-09 12:59:31,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:31,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:31,949 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand 10 states. [2020-11-09 12:59:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:32,434 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2020-11-09 12:59:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:59:32,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:32,436 INFO L225 Difference]: With dead ends: 116 [2020-11-09 12:59:32,436 INFO L226 Difference]: Without dead ends: 101 [2020-11-09 12:59:32,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-09 12:59:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-11-09 12:59:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-09 12:59:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 132 transitions. [2020-11-09 12:59:32,441 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 132 transitions. Word has length 16 [2020-11-09 12:59:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:32,442 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 132 transitions. [2020-11-09 12:59:32,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 132 transitions. [2020-11-09 12:59:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:32,442 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:32,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:32,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:59:32,443 INFO L429 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-11-09 12:59:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1002549257, now seen corresponding path program 6 times [2020-11-09 12:59:32,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:32,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124537396] [2020-11-09 12:59:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:33,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124537396] [2020-11-09 12:59:33,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:33,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:33,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366986960] [2020-11-09 12:59:33,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:33,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:33,018 INFO L87 Difference]: Start difference. First operand 79 states and 132 transitions. Second operand 10 states. [2020-11-09 12:59:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:33,502 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2020-11-09 12:59:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:33,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:33,504 INFO L225 Difference]: With dead ends: 104 [2020-11-09 12:59:33,504 INFO L226 Difference]: Without dead ends: 93 [2020-11-09 12:59:33,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-09 12:59:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2020-11-09 12:59:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-09 12:59:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 134 transitions. [2020-11-09 12:59:33,509 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 134 transitions. Word has length 16 [2020-11-09 12:59:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:33,509 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 134 transitions. [2020-11-09 12:59:33,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 134 transitions. [2020-11-09 12:59:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:33,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:33,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:33,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:59:33,510 INFO L429 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-11-09 12:59:33,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 615893921, now seen corresponding path program 7 times [2020-11-09 12:59:33,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:33,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282146727] [2020-11-09 12:59:33,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:34,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282146727] [2020-11-09 12:59:34,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:34,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:34,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606102707] [2020-11-09 12:59:34,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:34,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:34,153 INFO L87 Difference]: Start difference. First operand 81 states and 134 transitions. Second operand 10 states. [2020-11-09 12:59:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:34,643 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2020-11-09 12:59:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:59:34,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:34,644 INFO L225 Difference]: With dead ends: 110 [2020-11-09 12:59:34,644 INFO L226 Difference]: Without dead ends: 95 [2020-11-09 12:59:34,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-09 12:59:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2020-11-09 12:59:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-09 12:59:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 130 transitions. [2020-11-09 12:59:34,649 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 130 transitions. Word has length 16 [2020-11-09 12:59:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:34,650 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 130 transitions. [2020-11-09 12:59:34,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 130 transitions. [2020-11-09 12:59:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:34,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:34,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:34,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:59:34,651 INFO L429 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-11-09 12:59:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:34,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1037223855, now seen corresponding path program 8 times [2020-11-09 12:59:34,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:34,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311678722] [2020-11-09 12:59:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:35,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311678722] [2020-11-09 12:59:35,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:35,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:35,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390813146] [2020-11-09 12:59:35,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:35,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:35,265 INFO L87 Difference]: Start difference. First operand 79 states and 130 transitions. Second operand 10 states. [2020-11-09 12:59:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:35,798 INFO L93 Difference]: Finished difference Result 99 states and 159 transitions. [2020-11-09 12:59:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:35,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:35,799 INFO L225 Difference]: With dead ends: 99 [2020-11-09 12:59:35,799 INFO L226 Difference]: Without dead ends: 86 [2020-11-09 12:59:35,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-09 12:59:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2020-11-09 12:59:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-09 12:59:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 131 transitions. [2020-11-09 12:59:35,803 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 131 transitions. Word has length 16 [2020-11-09 12:59:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:35,804 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 131 transitions. [2020-11-09 12:59:35,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions. [2020-11-09 12:59:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:35,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:35,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:35,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:59:35,805 INFO L429 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-11-09 12:59:35,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:35,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1150182227, now seen corresponding path program 9 times [2020-11-09 12:59:35,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:35,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953432948] [2020-11-09 12:59:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:36,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953432948] [2020-11-09 12:59:36,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:36,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:36,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112279836] [2020-11-09 12:59:36,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:36,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:36,415 INFO L87 Difference]: Start difference. First operand 80 states and 131 transitions. Second operand 10 states. [2020-11-09 12:59:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:36,880 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2020-11-09 12:59:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:36,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:36,881 INFO L225 Difference]: With dead ends: 95 [2020-11-09 12:59:36,882 INFO L226 Difference]: Without dead ends: 79 [2020-11-09 12:59:36,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-09 12:59:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-11-09 12:59:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 12:59:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 126 transitions. [2020-11-09 12:59:36,885 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 126 transitions. Word has length 16 [2020-11-09 12:59:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:36,886 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 126 transitions. [2020-11-09 12:59:36,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2020-11-09 12:59:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:36,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:36,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:36,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 12:59:36,887 INFO L429 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-11-09 12:59:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash -123632883, now seen corresponding path program 10 times [2020-11-09 12:59:36,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:36,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10746914] [2020-11-09 12:59:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:37,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10746914] [2020-11-09 12:59:37,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:37,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:37,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138790417] [2020-11-09 12:59:37,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:37,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:37,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:37,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:37,555 INFO L87 Difference]: Start difference. First operand 77 states and 126 transitions. Second operand 10 states. [2020-11-09 12:59:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:37,996 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2020-11-09 12:59:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:37,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:37,998 INFO L225 Difference]: With dead ends: 99 [2020-11-09 12:59:37,998 INFO L226 Difference]: Without dead ends: 82 [2020-11-09 12:59:37,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-09 12:59:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2020-11-09 12:59:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 12:59:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 125 transitions. [2020-11-09 12:59:38,003 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 125 transitions. Word has length 16 [2020-11-09 12:59:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:38,003 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 125 transitions. [2020-11-09 12:59:38,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2020-11-09 12:59:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:38,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:38,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:38,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 12:59:38,004 INFO L429 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-11-09 12:59:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1031972303, now seen corresponding path program 11 times [2020-11-09 12:59:38,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:38,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526237483] [2020-11-09 12:59:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:38,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526237483] [2020-11-09 12:59:38,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:38,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:38,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542222404] [2020-11-09 12:59:38,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:38,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:38,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:38,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:38,668 INFO L87 Difference]: Start difference. First operand 77 states and 125 transitions. Second operand 10 states. [2020-11-09 12:59:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:39,170 INFO L93 Difference]: Finished difference Result 96 states and 152 transitions. [2020-11-09 12:59:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:39,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:39,172 INFO L225 Difference]: With dead ends: 96 [2020-11-09 12:59:39,172 INFO L226 Difference]: Without dead ends: 83 [2020-11-09 12:59:39,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-09 12:59:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-11-09 12:59:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-09 12:59:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions. [2020-11-09 12:59:39,179 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 16 [2020-11-09 12:59:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:39,179 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 126 transitions. [2020-11-09 12:59:39,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions. [2020-11-09 12:59:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:39,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:39,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:39,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 12:59:39,182 INFO L429 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-11-09 12:59:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1144930675, now seen corresponding path program 12 times [2020-11-09 12:59:39,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:39,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692369603] [2020-11-09 12:59:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:39,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692369603] [2020-11-09 12:59:39,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:39,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:39,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765185670] [2020-11-09 12:59:39,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:39,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:39,898 INFO L87 Difference]: Start difference. First operand 78 states and 126 transitions. Second operand 10 states. [2020-11-09 12:59:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:40,365 INFO L93 Difference]: Finished difference Result 96 states and 151 transitions. [2020-11-09 12:59:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:40,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:40,367 INFO L225 Difference]: With dead ends: 96 [2020-11-09 12:59:40,367 INFO L226 Difference]: Without dead ends: 77 [2020-11-09 12:59:40,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-09 12:59:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-11-09 12:59:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-09 12:59:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2020-11-09 12:59:40,370 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 16 [2020-11-09 12:59:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:40,371 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2020-11-09 12:59:40,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2020-11-09 12:59:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:40,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:40,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:40,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 12:59:40,372 INFO L429 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-11-09 12:59:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash 23037531, now seen corresponding path program 13 times [2020-11-09 12:59:40,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:40,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240688738] [2020-11-09 12:59:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:40,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240688738] [2020-11-09 12:59:40,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:40,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:40,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001304709] [2020-11-09 12:59:40,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:40,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:40,890 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand 10 states. [2020-11-09 12:59:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:41,360 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-11-09 12:59:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:41,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:41,361 INFO L225 Difference]: With dead ends: 95 [2020-11-09 12:59:41,362 INFO L226 Difference]: Without dead ends: 84 [2020-11-09 12:59:41,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-09 12:59:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-11-09 12:59:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-09 12:59:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 118 transitions. [2020-11-09 12:59:41,365 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 118 transitions. Word has length 16 [2020-11-09 12:59:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:41,365 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 118 transitions. [2020-11-09 12:59:41,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 118 transitions. [2020-11-09 12:59:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:41,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:41,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:41,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 12:59:41,369 INFO L429 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-11-09 12:59:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1641480709, now seen corresponding path program 14 times [2020-11-09 12:59:41,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:41,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354553439] [2020-11-09 12:59:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:41,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354553439] [2020-11-09 12:59:41,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:41,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:41,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603029211] [2020-11-09 12:59:41,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:41,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:41,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:41,953 INFO L87 Difference]: Start difference. First operand 74 states and 118 transitions. Second operand 10 states. [2020-11-09 12:59:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:42,495 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-11-09 12:59:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:59:42,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:42,497 INFO L225 Difference]: With dead ends: 97 [2020-11-09 12:59:42,497 INFO L226 Difference]: Without dead ends: 82 [2020-11-09 12:59:42,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-09 12:59:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2020-11-09 12:59:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-09 12:59:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2020-11-09 12:59:42,500 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 16 [2020-11-09 12:59:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:42,500 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2020-11-09 12:59:42,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2020-11-09 12:59:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:42,501 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:42,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:42,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-09 12:59:42,501 INFO L429 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-11-09 12:59:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1892099271, now seen corresponding path program 1 times [2020-11-09 12:59:42,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:42,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751566749] [2020-11-09 12:59:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:42,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751566749] [2020-11-09 12:59:42,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:42,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:59:42,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044972416] [2020-11-09 12:59:42,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:59:42,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:59:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:59:42,626 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand 8 states. [2020-11-09 12:59:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:43,095 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2020-11-09 12:59:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:43,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-09 12:59:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:43,097 INFO L225 Difference]: With dead ends: 63 [2020-11-09 12:59:43,097 INFO L226 Difference]: Without dead ends: 63 [2020-11-09 12:59:43,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-09 12:59:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-11-09 12:59:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-09 12:59:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2020-11-09 12:59:43,100 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 16 [2020-11-09 12:59:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:43,101 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2020-11-09 12:59:43,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:59:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2020-11-09 12:59:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:43,101 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:43,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:43,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-09 12:59:43,102 INFO L429 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-11-09 12:59:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1908784089, now seen corresponding path program 15 times [2020-11-09 12:59:43,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:43,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261215163] [2020-11-09 12:59:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:43,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261215163] [2020-11-09 12:59:43,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:43,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:43,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184200810] [2020-11-09 12:59:43,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:43,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:43,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:43,610 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 10 states. [2020-11-09 12:59:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:44,125 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2020-11-09 12:59:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:44,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:44,127 INFO L225 Difference]: With dead ends: 68 [2020-11-09 12:59:44,127 INFO L226 Difference]: Without dead ends: 58 [2020-11-09 12:59:44,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-09 12:59:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-11-09 12:59:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 12:59:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2020-11-09 12:59:44,130 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 16 [2020-11-09 12:59:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:44,130 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2020-11-09 12:59:44,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2020-11-09 12:59:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:44,131 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:44,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:44,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-09 12:59:44,131 INFO L429 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-11-09 12:59:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash -899896281, now seen corresponding path program 16 times [2020-11-09 12:59:44,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:44,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454929992] [2020-11-09 12:59:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:44,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454929992] [2020-11-09 12:59:44,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:44,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:44,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413624307] [2020-11-09 12:59:44,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:44,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:44,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:44,632 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 10 states. [2020-11-09 12:59:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:45,092 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2020-11-09 12:59:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:45,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:45,094 INFO L225 Difference]: With dead ends: 79 [2020-11-09 12:59:45,094 INFO L226 Difference]: Without dead ends: 68 [2020-11-09 12:59:45,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-09 12:59:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2020-11-09 12:59:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 12:59:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2020-11-09 12:59:45,097 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 16 [2020-11-09 12:59:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:45,097 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2020-11-09 12:59:45,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2020-11-09 12:59:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:45,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:45,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:45,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-09 12:59:45,098 INFO L429 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-11-09 12:59:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 831505269, now seen corresponding path program 17 times [2020-11-09 12:59:45,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:45,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797669866] [2020-11-09 12:59:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:45,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797669866] [2020-11-09 12:59:45,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:45,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:45,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656460734] [2020-11-09 12:59:45,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:45,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:45,653 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand 10 states. [2020-11-09 12:59:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:46,172 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2020-11-09 12:59:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:59:46,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:46,173 INFO L225 Difference]: With dead ends: 79 [2020-11-09 12:59:46,173 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 12:59:46,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 12:59:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-11-09 12:59:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-09 12:59:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-11-09 12:59:46,177 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 16 [2020-11-09 12:59:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:46,177 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-11-09 12:59:46,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-11-09 12:59:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:46,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:46,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:46,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-09 12:59:46,178 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:59:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash -501689167, now seen corresponding path program 18 times [2020-11-09 12:59:46,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:46,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931789911] [2020-11-09 12:59:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:46,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931789911] [2020-11-09 12:59:46,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:46,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:46,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422624686] [2020-11-09 12:59:46,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:46,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:46,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:46,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:46,644 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 10 states. [2020-11-09 12:59:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:47,112 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2020-11-09 12:59:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:47,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:47,113 INFO L225 Difference]: With dead ends: 70 [2020-11-09 12:59:47,113 INFO L226 Difference]: Without dead ends: 59 [2020-11-09 12:59:47,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-09 12:59:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2020-11-09 12:59:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-09 12:59:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2020-11-09 12:59:47,115 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 16 [2020-11-09 12:59:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:47,115 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2020-11-09 12:59:47,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2020-11-09 12:59:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:47,116 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:47,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:47,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-09 12:59:47,116 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:59:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:47,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1116754011, now seen corresponding path program 19 times [2020-11-09 12:59:47,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:47,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622354769] [2020-11-09 12:59:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:47,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622354769] [2020-11-09 12:59:47,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:47,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:47,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630612075] [2020-11-09 12:59:47,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:47,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:47,666 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 10 states. [2020-11-09 12:59:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:48,128 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-11-09 12:59:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:59:48,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:48,130 INFO L225 Difference]: With dead ends: 66 [2020-11-09 12:59:48,130 INFO L226 Difference]: Without dead ends: 57 [2020-11-09 12:59:48,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-09 12:59:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2020-11-09 12:59:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-09 12:59:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2020-11-09 12:59:48,132 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 16 [2020-11-09 12:59:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:48,133 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2020-11-09 12:59:48,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2020-11-09 12:59:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:48,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:48,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:48,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-09 12:59:48,134 INFO L429 AbstractCegarLoop]: === Iteration 28 === [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-11-09 12:59:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash -536363765, now seen corresponding path program 20 times [2020-11-09 12:59:48,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:48,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441855152] [2020-11-09 12:59:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:48,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441855152] [2020-11-09 12:59:48,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:48,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:48,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663488195] [2020-11-09 12:59:48,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:48,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:48,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:48,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:48,667 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 10 states. [2020-11-09 12:59:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:49,211 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2020-11-09 12:59:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:49,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:49,212 INFO L225 Difference]: With dead ends: 59 [2020-11-09 12:59:49,212 INFO L226 Difference]: Without dead ends: 49 [2020-11-09 12:59:49,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-09 12:59:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-11-09 12:59:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-09 12:59:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2020-11-09 12:59:49,216 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 16 [2020-11-09 12:59:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:49,216 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2020-11-09 12:59:49,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2020-11-09 12:59:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:49,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:49,216 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:49,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-09 12:59:49,217 INFO L429 AbstractCegarLoop]: === Iteration 29 === [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-11-09 12:59:49,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -649322137, now seen corresponding path program 21 times [2020-11-09 12:59:49,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:49,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716125187] [2020-11-09 12:59:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:49,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716125187] [2020-11-09 12:59:49,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:49,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:49,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557157039] [2020-11-09 12:59:49,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:49,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:49,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:49,753 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand 10 states. [2020-11-09 12:59:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:50,259 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2020-11-09 12:59:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:50,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:50,261 INFO L225 Difference]: With dead ends: 55 [2020-11-09 12:59:50,261 INFO L226 Difference]: Without dead ends: 45 [2020-11-09 12:59:50,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-09 12:59:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2020-11-09 12:59:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-09 12:59:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2020-11-09 12:59:50,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 16 [2020-11-09 12:59:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:50,264 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2020-11-09 12:59:50,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2020-11-09 12:59:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:50,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:50,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:50,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-09 12:59:50,264 INFO L429 AbstractCegarLoop]: === Iteration 30 === [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-11-09 12:59:50,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:50,265 INFO L82 PathProgramCache]: Analyzing trace with hash -822569829, now seen corresponding path program 22 times [2020-11-09 12:59:50,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:50,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504995360] [2020-11-09 12:59:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:50,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504995360] [2020-11-09 12:59:50,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:50,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:50,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872736457] [2020-11-09 12:59:50,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:50,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:50,774 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2020-11-09 12:59:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:51,252 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2020-11-09 12:59:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:51,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:51,254 INFO L225 Difference]: With dead ends: 51 [2020-11-09 12:59:51,254 INFO L226 Difference]: Without dead ends: 43 [2020-11-09 12:59:51,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-09 12:59:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-09 12:59:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-09 12:59:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-11-09 12:59:51,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-11-09 12:59:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:51,260 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-11-09 12:59:51,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-11-09 12:59:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:51,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:51,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:51,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-09 12:59:51,262 INFO L429 AbstractCegarLoop]: === Iteration 31 === [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-11-09 12:59:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1074577193, now seen corresponding path program 23 times [2020-11-09 12:59:51,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:51,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865246936] [2020-11-09 12:59:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:51,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865246936] [2020-11-09 12:59:51,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:51,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:51,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219017618] [2020-11-09 12:59:51,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:51,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:51,787 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 10 states. [2020-11-09 12:59:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:52,305 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2020-11-09 12:59:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:52,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:52,307 INFO L225 Difference]: With dead ends: 53 [2020-11-09 12:59:52,307 INFO L226 Difference]: Without dead ends: 43 [2020-11-09 12:59:52,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-09 12:59:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-09 12:59:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-09 12:59:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-11-09 12:59:52,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 16 [2020-11-09 12:59:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:52,310 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-11-09 12:59:52,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2020-11-09 12:59:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:52,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:52,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:52,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-09 12:59:52,311 INFO L429 AbstractCegarLoop]: === Iteration 32 === [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-11-09 12:59:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash 961618821, now seen corresponding path program 24 times [2020-11-09 12:59:52,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:52,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602819608] [2020-11-09 12:59:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:52,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602819608] [2020-11-09 12:59:52,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:52,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:52,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007081925] [2020-11-09 12:59:52,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:52,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:52,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:52,852 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 10 states. [2020-11-09 12:59:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:53,335 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2020-11-09 12:59:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:53,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:53,336 INFO L225 Difference]: With dead ends: 49 [2020-11-09 12:59:53,337 INFO L226 Difference]: Without dead ends: 38 [2020-11-09 12:59:53,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-11-09 12:59:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-11-09 12:59:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-09 12:59:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2020-11-09 12:59:53,339 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 16 [2020-11-09 12:59:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:53,340 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-11-09 12:59:53,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2020-11-09 12:59:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:53,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:53,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:53,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-09 12:59:53,340 INFO L429 AbstractCegarLoop]: === Iteration 33 === [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-11-09 12:59:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 540025319, now seen corresponding path program 25 times [2020-11-09 12:59:53,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:53,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295176811] [2020-11-09 12:59:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:53,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295176811] [2020-11-09 12:59:53,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:53,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:53,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627054550] [2020-11-09 12:59:53,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:53,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:53,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:53,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:53,829 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 10 states. [2020-11-09 12:59:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:54,275 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-11-09 12:59:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:54,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:54,276 INFO L225 Difference]: With dead ends: 38 [2020-11-09 12:59:54,276 INFO L226 Difference]: Without dead ends: 24 [2020-11-09 12:59:54,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-09 12:59:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-09 12:59:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-09 12:59:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-11-09 12:59:54,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-11-09 12:59:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:54,279 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-09 12:59:54,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-11-09 12:59:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:54,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:54,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:54,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-09 12:59:54,280 INFO L429 AbstractCegarLoop]: === Iteration 34 === [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-11-09 12:59:54,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash -368314139, now seen corresponding path program 4 times [2020-11-09 12:59:54,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:54,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512146520] [2020-11-09 12:59:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:54,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512146520] [2020-11-09 12:59:54,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:54,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:59:54,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192329415] [2020-11-09 12:59:54,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:59:54,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:59:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:59:54,713 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 9 states. [2020-11-09 12:59:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:55,062 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-11-09 12:59:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:55,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 12:59:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:55,063 INFO L225 Difference]: With dead ends: 23 [2020-11-09 12:59:55,063 INFO L226 Difference]: Without dead ends: 23 [2020-11-09 12:59:55,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-09 12:59:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-11-09 12:59:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-09 12:59:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-09 12:59:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-11-09 12:59:55,064 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2020-11-09 12:59:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:55,065 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-09 12:59:55,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:59:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-11-09 12:59:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:55,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:55,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:55,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-09 12:59:55,065 INFO L429 AbstractCegarLoop]: === Iteration 35 === [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-11-09 12:59:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -368314101, now seen corresponding path program 26 times [2020-11-09 12:59:55,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:55,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511945836] [2020-11-09 12:59:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:55,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511945836] [2020-11-09 12:59:55,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:55,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:55,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756510662] [2020-11-09 12:59:55,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:55,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:55,619 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 10 states. [2020-11-09 12:59:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:56,035 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-11-09 12:59:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:56,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:56,037 INFO L225 Difference]: With dead ends: 35 [2020-11-09 12:59:56,037 INFO L226 Difference]: Without dead ends: 25 [2020-11-09 12:59:56,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-09 12:59:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-11-09 12:59:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-09 12:59:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-11-09 12:59:56,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-11-09 12:59:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:56,040 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-09 12:59:56,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-11-09 12:59:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:56,040 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:56,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:56,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-09 12:59:56,041 INFO L429 AbstractCegarLoop]: === Iteration 36 === [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-11-09 12:59:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -481272473, now seen corresponding path program 27 times [2020-11-09 12:59:56,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:56,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017506816] [2020-11-09 12:59:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:56,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017506816] [2020-11-09 12:59:56,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:56,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:56,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866037376] [2020-11-09 12:59:56,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:56,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:56,519 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 10 states. [2020-11-09 12:59:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:56,995 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-11-09 12:59:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:56,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:56,996 INFO L225 Difference]: With dead ends: 31 [2020-11-09 12:59:56,996 INFO L226 Difference]: Without dead ends: 22 [2020-11-09 12:59:56,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-11-09 12:59:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-09 12:59:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-09 12:59:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-11-09 12:59:56,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2020-11-09 12:59:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:56,998 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-11-09 12:59:56,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-11-09 12:59:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:56,999 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:56,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:56,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-09 12:59:57,000 INFO L429 AbstractCegarLoop]: === Iteration 37 === [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-11-09 12:59:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash -659771717, now seen corresponding path program 28 times [2020-11-09 12:59:57,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:57,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487498044] [2020-11-09 12:59:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:57,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487498044] [2020-11-09 12:59:57,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:57,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:57,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260259779] [2020-11-09 12:59:57,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:57,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:57,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:57,499 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 10 states. [2020-11-09 12:59:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:57,855 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-11-09 12:59:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:57,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:57,856 INFO L225 Difference]: With dead ends: 29 [2020-11-09 12:59:57,856 INFO L226 Difference]: Without dead ends: 21 [2020-11-09 12:59:57,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-11-09 12:59:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-09 12:59:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-09 12:59:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-11-09 12:59:57,858 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-11-09 12:59:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:57,858 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-11-09 12:59:57,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-11-09 12:59:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:57,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:57,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:57,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-09 12:59:57,859 INFO L429 AbstractCegarLoop]: === Iteration 38 === [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-11-09 12:59:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1237375305, now seen corresponding path program 29 times [2020-11-09 12:59:57,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:57,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63412731] [2020-11-09 12:59:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:58,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63412731] [2020-11-09 12:59:58,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:58,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:58,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569723971] [2020-11-09 12:59:58,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:58,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:58,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:58,363 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2020-11-09 12:59:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:58,754 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-11-09 12:59:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:58,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:58,756 INFO L225 Difference]: With dead ends: 27 [2020-11-09 12:59:58,756 INFO L226 Difference]: Without dead ends: 17 [2020-11-09 12:59:58,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-11-09 12:59:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-11-09 12:59:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-09 12:59:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2020-11-09 12:59:58,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 16 [2020-11-09 12:59:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:58,757 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2020-11-09 12:59:58,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-11-09 12:59:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:59:58,758 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:58,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:59:58,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-09 12:59:58,758 INFO L429 AbstractCegarLoop]: === Iteration 39 === [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-11-09 12:59:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1124416933, now seen corresponding path program 30 times [2020-11-09 12:59:58,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:58,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148339103] [2020-11-09 12:59:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:59:59,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148339103] [2020-11-09 12:59:59,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:59,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:59:59,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310666108] [2020-11-09 12:59:59,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:59:59,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:59:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:59:59,312 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand 10 states. [2020-11-09 12:59:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:59,644 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-11-09 12:59:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:59,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 12:59:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:59,644 INFO L225 Difference]: With dead ends: 16 [2020-11-09 12:59:59,644 INFO L226 Difference]: Without dead ends: 0 [2020-11-09 12:59:59,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:59:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-09 12:59:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-09 12:59:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-09 12:59:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-09 12:59:59,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-11-09 12:59:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:59,645 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-09 12:59:59,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:59:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-09 12:59:59,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-09 12:59:59,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-09 12:59:59,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:59:59 BasicIcfg [2020-11-09 12:59:59,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:59:59,651 INFO L168 Benchmark]: Toolchain (without parser) took 109910.33 ms. Allocated memory was 162.5 MB in the beginning and 320.9 MB in the end (delta: 158.3 MB). Free memory was 134.2 MB in the beginning and 218.6 MB in the end (delta: -84.4 MB). Peak memory consumption was 74.6 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:59,653 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 162.5 MB. Free memory is still 135.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:59:59,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1574.84 ms. Allocated memory was 162.5 MB in the beginning and 222.3 MB in the end (delta: 59.8 MB). Free memory was 133.6 MB in the beginning and 178.7 MB in the end (delta: -45.0 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:59,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.28 ms. Allocated memory is still 222.3 MB. Free memory was 178.7 MB in the beginning and 175.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:59,658 INFO L168 Benchmark]: Boogie Preprocessor took 57.18 ms. Allocated memory is still 222.3 MB. Free memory was 175.5 MB in the beginning and 172.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:59,659 INFO L168 Benchmark]: RCFGBuilder took 1237.37 ms. Allocated memory is still 222.3 MB. Free memory was 172.9 MB in the beginning and 121.5 MB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:59,659 INFO L168 Benchmark]: TraceAbstraction took 106910.75 ms. Allocated memory was 222.3 MB in the beginning and 320.9 MB in the end (delta: 98.6 MB). Free memory was 121.5 MB in the beginning and 218.6 MB in the end (delta: -97.1 MB). Peak memory consumption was 1.5 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:59,661 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 162.5 MB. Free memory is still 135.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1574.84 ms. Allocated memory was 162.5 MB in the beginning and 222.3 MB in the end (delta: 59.8 MB). Free memory was 133.6 MB in the beginning and 178.7 MB in the end (delta: -45.0 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 116.28 ms. Allocated memory is still 222.3 MB. Free memory was 178.7 MB in the beginning and 175.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.18 ms. Allocated memory is still 222.3 MB. Free memory was 175.5 MB in the beginning and 172.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1237.37 ms. Allocated memory is still 222.3 MB. Free memory was 172.9 MB in the beginning and 121.5 MB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 106910.75 ms. Allocated memory was 222.3 MB in the beginning and 320.9 MB in the end (delta: 98.6 MB). Free memory was 121.5 MB in the beginning and 218.6 MB in the end (delta: -97.1 MB). Peak memory consumption was 1.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1253 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 17 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 39.2s, 30 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 69.4s, 168 PlacesBefore, 34 PlacesAfterwards, 178 TransitionsBefore, 32 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 8 FixpointIterations, 112 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 24 ConcurrentYvCompositions, 12 ChoiceCompositions, 222 TotalNumberOfCompositions, 3600 MoverChecksTotal - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: 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, 153 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 106.7s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 69.4s, HoareTripleCheckerStatistics: 617 SDtfs, 551 SDslu, 1999 SDs, 0 SdLazy, 5154 SolverSat, 580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 282 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 193344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...