/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:18:02,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:18:02,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:18:02,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:18:02,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:18:02,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:18:02,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:18:02,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:18:02,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:18:02,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:18:02,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:18:02,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:18:02,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:18:02,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:18:02,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:18:02,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:18:02,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:18:02,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:18:02,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:18:02,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:18:02,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:18:02,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:18:02,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:18:02,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:18:02,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:18:02,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:18:02,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:18:02,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:18:02,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:18:02,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:18:02,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:18:02,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:18:02,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:18:02,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:18:02,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:18:02,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:18:02,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:18:02,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:18:02,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:18:02,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:18:02,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:18:02,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:18:02,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:18:02,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:18:02,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:18:02,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:18:02,431 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:18:02,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:18:02,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:18:02,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:18:02,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:18:02,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:18:02,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:18:02,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:18:02,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:18:02,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:18:02,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:18:02,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:18:02,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:18:02,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:18:02,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:18:02,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:18:02,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:18:02,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:18:02,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:18:02,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:18:02,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:18:02,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:18:02,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:18:02,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:18:02,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:18:02,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:18:02,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:18:02,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:18:02,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:18:02,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:18:02,739 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:18:02,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-18 15:18:02,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7d0fb53/c4ee7a0149e140189b7075c23f20e8fe/FLAG76a5123cd [2019-12-18 15:18:03,404 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:18:03,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-18 15:18:03,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7d0fb53/c4ee7a0149e140189b7075c23f20e8fe/FLAG76a5123cd [2019-12-18 15:18:03,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7d0fb53/c4ee7a0149e140189b7075c23f20e8fe [2019-12-18 15:18:03,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:18:03,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:18:03,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:18:03,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:18:03,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:18:03,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:18:03" (1/1) ... [2019-12-18 15:18:03,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450b3513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:03, skipping insertion in model container [2019-12-18 15:18:03,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:18:03" (1/1) ... [2019-12-18 15:18:03,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:18:03,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:18:04,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:18:04,571 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:18:04,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:18:05,118 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:18:05,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05 WrapperNode [2019-12-18 15:18:05,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:18:05,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:18:05,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:18:05,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:18:05,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:18:05,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:18:05,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:18:05,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:18:05,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... [2019-12-18 15:18:05,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:18:05,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:18:05,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:18:05,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:18:05,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:18:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:18:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:18:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 15:18:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-18 15:18:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:18:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:18:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-18 15:18:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-18 15:18:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:18:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:18:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 15:18:05,317 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:18:06,109 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:18:06,109 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-18 15:18:06,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:18:06 BoogieIcfgContainer [2019-12-18 15:18:06,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:18:06,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:18:06,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:18:06,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:18:06,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:18:03" (1/3) ... [2019-12-18 15:18:06,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fc5a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:18:06, skipping insertion in model container [2019-12-18 15:18:06,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:18:05" (2/3) ... [2019-12-18 15:18:06,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fc5a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:18:06, skipping insertion in model container [2019-12-18 15:18:06,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:18:06" (3/3) ... [2019-12-18 15:18:06,120 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2019-12-18 15:18:06,130 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:18:06,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:18:06,139 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-18 15:18:06,140 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:18:06,173 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,174 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,174 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,174 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,175 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,175 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,175 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,175 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,175 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,176 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,177 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,178 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,178 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,178 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,179 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,180 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,180 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,180 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,180 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,181 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,181 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,181 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,181 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,182 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,182 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,183 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,183 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,184 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,185 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,186 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,187 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,187 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,187 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,188 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,188 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,188 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,188 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,189 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,189 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,189 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,189 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,190 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,190 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,190 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,190 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,191 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,194 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,195 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,195 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,195 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,195 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,196 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,196 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,196 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,196 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,197 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,197 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,197 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,204 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,204 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,204 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,204 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,205 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,205 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,205 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,206 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,206 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,206 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,206 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,206 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:18:06,235 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 15:18:06,255 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:18:06,256 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:18:06,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:18:06,256 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:18:06,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:18:06,256 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:18:06,257 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:18:06,257 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:18:06,290 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions [2019-12-18 15:18:06,292 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-18 15:18:06,394 INFO L126 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-18 15:18:06,394 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:18:06,403 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 21/194 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-18 15:18:06,419 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-18 15:18:06,476 INFO L126 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-18 15:18:06,476 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:18:06,481 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 21/194 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-18 15:18:06,490 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2884 [2019-12-18 15:18:06,491 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:18:06,641 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:06,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:06,688 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:06,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:06,723 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:06,724 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:06,741 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:06,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:06,781 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:06,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:06,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:06,811 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:08,897 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:08,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:08,948 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:08,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:08,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:08,980 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 15:18:08,997 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:09,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:09,039 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:09,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:09,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:09,081 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:11,529 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:11,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:11,580 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:11,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:11,614 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:11,614 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 15:18:11,632 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:11,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:11,671 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:11,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:11,710 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:11,711 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:13,838 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:13,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:13,891 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:13,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:13,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:13,920 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:13,943 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:14,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:14,011 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:14,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:14,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:14,068 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:16,383 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:16,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:16,431 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:16,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:16,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:16,461 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:16,476 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:16,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:16,522 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:16,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:16,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:16,551 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 15:18:19,287 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:19,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:19,340 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:19,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:19,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:19,375 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:19,402 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:19,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:19,452 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:19,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:19,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:19,486 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 15:18:21,529 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:21,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:21,568 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:21,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:21,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:21,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:21,609 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:21,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:21,644 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:21,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:21,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:21,676 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 15:18:23,734 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:23,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:23,773 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:23,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:23,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:23,803 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 15:18:23,833 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:23,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:23,866 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:23,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:23,891 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:23,891 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:26,230 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:26,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:26,269 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:26,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:26,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:26,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:26,315 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:26,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:26,368 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:26,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:26,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:26,400 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 15:18:28,712 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:28,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:28,765 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:28,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:28,807 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:28,808 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-18 15:18:28,823 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:28,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:28,878 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:28,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:28,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:28,927 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:31,225 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:31,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:31,277 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:31,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:31,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:31,309 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:31,322 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:31,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:31,364 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:31,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:31,396 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:31,397 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:33,938 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:33,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:33,977 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:34,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:34,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:34,011 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:34,022 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:34,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:34,067 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:34,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:34,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:34,099 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:36,129 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:36,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:36,168 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:36,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:36,203 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:36,203 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:36,221 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:36,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:36,270 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:36,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:36,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:36,307 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:38,469 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:38,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:38,506 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:38,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:38,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:38,537 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:38,551 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:38,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:38,592 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:38,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:38,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:38,627 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:41,069 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:41,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:41,110 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:41,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:41,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:41,141 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-18 15:18:41,153 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:41,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:41,192 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:41,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:41,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:41,220 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:43,382 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:43,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:43,432 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:43,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:43,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:43,489 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:43,503 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:43,570 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:43,578 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:43,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:43,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:43,640 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-18 15:18:45,714 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:45,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:45,772 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:45,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:45,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:45,795 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-18 15:18:45,903 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:45,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:45,939 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:45,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:45,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:45,967 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:45,988 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:46,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:46,029 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:46,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:46,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:46,054 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:48,431 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:48,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:48,465 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:48,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:48,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:48,494 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:48,518 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:48,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:48,568 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:48,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:48,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:48,602 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-18 15:18:50,646 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,681 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,708 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 15:18:50,731 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,767 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,799 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-18 15:18:50,814 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,850 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,882 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:50,893 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,928 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:50,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:50,956 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:53,076 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:53,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:53,111 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:53,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:53,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:53,142 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 15:18:53,153 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:53,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:53,186 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:53,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:53,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:53,214 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-18 15:18:55,330 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:55,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:55,364 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:55,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:55,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:55,391 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-18 15:18:55,401 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:55,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:55,437 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:55,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:55,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:55,462 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 15:18:57,874 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-18 15:18:58,660 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-18 15:18:58,735 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,770 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,797 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-18 15:18:58,807 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,841 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,867 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-18 15:18:58,881 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,919 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,944 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:18:58,955 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:58,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:58,994 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:59,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:18:59,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:18:59,031 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-18 15:19:01,319 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-18 15:19:01,536 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-18 15:19:02,159 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-12-18 15:19:02,329 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-18 15:19:03,117 WARN L192 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-12-18 15:19:03,134 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:19:03,600 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-18 15:19:03,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:19:03,612 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:19:04,061 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-18 15:19:04,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:19:04,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:19:04,063 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2019-12-18 15:19:04,352 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-18 15:19:05,503 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2019-12-18 15:19:05,536 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:19:06,415 WARN L192 SmtUtils]: Spent 878.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-18 15:19:06,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:19:06,425 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:19:06,930 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-18 15:19:06,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:19:06,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-18 15:19:06,932 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-18 15:19:07,461 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-18 15:19:07,788 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-18 15:19:08,082 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-18 15:19:08,096 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5217 [2019-12-18 15:19:08,096 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-18 15:19:08,100 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions [2019-12-18 15:19:08,126 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 462 states. [2019-12-18 15:19:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-12-18 15:19:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-18 15:19:08,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:08,135 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-18 15:19:08,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2019-12-18 15:19:08,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:08,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112415947] [2019-12-18 15:19:08,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:08,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112415947] [2019-12-18 15:19:08,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-18 15:19:08,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669574113] [2019-12-18 15:19:08,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 15:19:08,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 15:19:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 15:19:08,438 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 2 states. [2019-12-18 15:19:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:08,479 INFO L93 Difference]: Finished difference Result 460 states and 1126 transitions. [2019-12-18 15:19:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 15:19:08,481 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-18 15:19:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:08,496 INFO L225 Difference]: With dead ends: 460 [2019-12-18 15:19:08,496 INFO L226 Difference]: Without dead ends: 385 [2019-12-18 15:19:08,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 15:19:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-18 15:19:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-12-18 15:19:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-18 15:19:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2019-12-18 15:19:08,577 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2019-12-18 15:19:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:08,577 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2019-12-18 15:19:08,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 15:19:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2019-12-18 15:19:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 15:19:08,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:08,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 15:19:08,580 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 17095183, now seen corresponding path program 1 times [2019-12-18 15:19:08,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:08,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274615434] [2019-12-18 15:19:08,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:08,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274615434] [2019-12-18 15:19:08,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:08,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:19:08,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567072656] [2019-12-18 15:19:08,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:19:08,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:19:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:19:08,806 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2019-12-18 15:19:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:08,949 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2019-12-18 15:19:08,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:19:08,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-18 15:19:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:08,956 INFO L225 Difference]: With dead ends: 540 [2019-12-18 15:19:08,956 INFO L226 Difference]: Without dead ends: 540 [2019-12-18 15:19:08,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:19:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-18 15:19:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2019-12-18 15:19:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-18 15:19:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2019-12-18 15:19:09,010 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2019-12-18 15:19:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:09,010 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2019-12-18 15:19:09,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:19:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2019-12-18 15:19:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 15:19:09,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:09,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-18 15:19:09,014 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:09,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -751398463, now seen corresponding path program 1 times [2019-12-18 15:19:09,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:09,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433829012] [2019-12-18 15:19:09,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:09,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433829012] [2019-12-18 15:19:09,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:09,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:19:09,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468014157] [2019-12-18 15:19:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:19:09,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:19:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:19:09,115 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2019-12-18 15:19:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:09,308 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2019-12-18 15:19:09,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:19:09,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-18 15:19:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:09,315 INFO L225 Difference]: With dead ends: 599 [2019-12-18 15:19:09,315 INFO L226 Difference]: Without dead ends: 514 [2019-12-18 15:19:09,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:19:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-18 15:19:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2019-12-18 15:19:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-18 15:19:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2019-12-18 15:19:09,336 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2019-12-18 15:19:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:09,336 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2019-12-18 15:19:09,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:19:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2019-12-18 15:19:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:19:09,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:09,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:09,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1452138275, now seen corresponding path program 1 times [2019-12-18 15:19:09,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:09,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693392615] [2019-12-18 15:19:09,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:09,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693392615] [2019-12-18 15:19:09,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:09,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:19:09,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135440578] [2019-12-18 15:19:09,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:19:09,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:19:09,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:19:09,443 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2019-12-18 15:19:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:09,464 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2019-12-18 15:19:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:19:09,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-18 15:19:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:09,470 INFO L225 Difference]: With dead ends: 162 [2019-12-18 15:19:09,471 INFO L226 Difference]: Without dead ends: 162 [2019-12-18 15:19:09,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:19:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-18 15:19:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-18 15:19:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 15:19:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-18 15:19:09,478 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-18 15:19:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:09,479 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-18 15:19:09,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:19:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-18 15:19:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:09,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:09,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:09,490 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2124244464, now seen corresponding path program 1 times [2019-12-18 15:19:09,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:09,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147099200] [2019-12-18 15:19:09,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:09,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147099200] [2019-12-18 15:19:09,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:09,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:19:09,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806848637] [2019-12-18 15:19:09,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:19:09,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:09,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:19:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:19:09,916 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2019-12-18 15:19:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:10,160 INFO L93 Difference]: Finished difference Result 186 states and 379 transitions. [2019-12-18 15:19:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:19:10,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:19:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:10,165 INFO L225 Difference]: With dead ends: 186 [2019-12-18 15:19:10,165 INFO L226 Difference]: Without dead ends: 186 [2019-12-18 15:19:10,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:19:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-18 15:19:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2019-12-18 15:19:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 15:19:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 335 transitions. [2019-12-18 15:19:10,171 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 335 transitions. Word has length 22 [2019-12-18 15:19:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:10,172 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 335 transitions. [2019-12-18 15:19:10,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:19:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 335 transitions. [2019-12-18 15:19:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:10,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:10,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:10,175 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:10,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash 732163342, now seen corresponding path program 1 times [2019-12-18 15:19:10,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:10,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809240483] [2019-12-18 15:19:10,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:10,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809240483] [2019-12-18 15:19:10,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:10,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:19:10,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663861952] [2019-12-18 15:19:10,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:19:10,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:10,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:19:10,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:19:10,330 INFO L87 Difference]: Start difference. First operand 162 states and 335 transitions. Second operand 5 states. [2019-12-18 15:19:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:10,532 INFO L93 Difference]: Finished difference Result 206 states and 412 transitions. [2019-12-18 15:19:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:19:10,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 15:19:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:10,534 INFO L225 Difference]: With dead ends: 206 [2019-12-18 15:19:10,534 INFO L226 Difference]: Without dead ends: 206 [2019-12-18 15:19:10,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:19:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-18 15:19:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2019-12-18 15:19:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-18 15:19:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-18 15:19:10,540 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-18 15:19:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:10,541 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-18 15:19:10,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:19:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-18 15:19:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:10,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:10,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:10,542 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash -55183662, now seen corresponding path program 2 times [2019-12-18 15:19:10,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:10,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023299653] [2019-12-18 15:19:10,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:11,457 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-12-18 15:19:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:12,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023299653] [2019-12-18 15:19:12,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:12,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:12,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451406649] [2019-12-18 15:19:12,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:12,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:12,046 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 16 states. [2019-12-18 15:19:12,576 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:12,896 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 15:19:13,184 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 15:19:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:14,349 INFO L93 Difference]: Finished difference Result 301 states and 558 transitions. [2019-12-18 15:19:14,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:19:14,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:14,353 INFO L225 Difference]: With dead ends: 301 [2019-12-18 15:19:14,353 INFO L226 Difference]: Without dead ends: 301 [2019-12-18 15:19:14,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-18 15:19:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 235. [2019-12-18 15:19:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-18 15:19:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 447 transitions. [2019-12-18 15:19:14,362 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 447 transitions. Word has length 22 [2019-12-18 15:19:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:14,362 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 447 transitions. [2019-12-18 15:19:14,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 447 transitions. [2019-12-18 15:19:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:14,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:14,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:14,364 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:14,364 INFO L82 PathProgramCache]: Analyzing trace with hash -55183677, now seen corresponding path program 1 times [2019-12-18 15:19:14,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:14,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305597055] [2019-12-18 15:19:14,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:14,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305597055] [2019-12-18 15:19:14,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:14,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:19:14,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467743198] [2019-12-18 15:19:14,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:19:14,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:19:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:19:14,856 INFO L87 Difference]: Start difference. First operand 235 states and 447 transitions. Second operand 9 states. [2019-12-18 15:19:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:15,465 INFO L93 Difference]: Finished difference Result 321 states and 587 transitions. [2019-12-18 15:19:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:19:15,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-18 15:19:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:15,467 INFO L225 Difference]: With dead ends: 321 [2019-12-18 15:19:15,468 INFO L226 Difference]: Without dead ends: 279 [2019-12-18 15:19:15,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:19:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-18 15:19:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2019-12-18 15:19:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-18 15:19:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 453 transitions. [2019-12-18 15:19:15,475 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 453 transitions. Word has length 22 [2019-12-18 15:19:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:15,475 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 453 transitions. [2019-12-18 15:19:15,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:19:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 453 transitions. [2019-12-18 15:19:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:15,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:15,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:15,477 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1284449614, now seen corresponding path program 2 times [2019-12-18 15:19:15,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:15,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015332574] [2019-12-18 15:19:15,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:15,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015332574] [2019-12-18 15:19:15,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:15,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:19:15,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900680544] [2019-12-18 15:19:15,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:19:15,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:19:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:19:15,674 INFO L87 Difference]: Start difference. First operand 235 states and 453 transitions. Second operand 6 states. [2019-12-18 15:19:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:16,162 INFO L93 Difference]: Finished difference Result 242 states and 463 transitions. [2019-12-18 15:19:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:19:16,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:19:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:16,164 INFO L225 Difference]: With dead ends: 242 [2019-12-18 15:19:16,165 INFO L226 Difference]: Without dead ends: 242 [2019-12-18 15:19:16,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:19:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-18 15:19:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2019-12-18 15:19:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-18 15:19:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 398 transitions. [2019-12-18 15:19:16,171 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 398 transitions. Word has length 22 [2019-12-18 15:19:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:16,171 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 398 transitions. [2019-12-18 15:19:16,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:19:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 398 transitions. [2019-12-18 15:19:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:16,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:16,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:16,173 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash 497102610, now seen corresponding path program 3 times [2019-12-18 15:19:16,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:16,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850482809] [2019-12-18 15:19:16,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:17,005 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-12-18 15:19:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:17,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850482809] [2019-12-18 15:19:17,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:17,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:17,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169199250] [2019-12-18 15:19:17,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:17,676 INFO L87 Difference]: Start difference. First operand 202 states and 398 transitions. Second operand 16 states. [2019-12-18 15:19:18,186 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:18,488 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:18,752 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 15:19:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:19,926 INFO L93 Difference]: Finished difference Result 308 states and 587 transitions. [2019-12-18 15:19:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:19:19,927 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:19,930 INFO L225 Difference]: With dead ends: 308 [2019-12-18 15:19:19,930 INFO L226 Difference]: Without dead ends: 295 [2019-12-18 15:19:19,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-18 15:19:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 202. [2019-12-18 15:19:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-18 15:19:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 397 transitions. [2019-12-18 15:19:19,937 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 397 transitions. Word has length 22 [2019-12-18 15:19:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:19,938 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 397 transitions. [2019-12-18 15:19:19,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 397 transitions. [2019-12-18 15:19:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:19,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:19,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:19,939 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:19,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2050812348, now seen corresponding path program 3 times [2019-12-18 15:19:19,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:19,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207573754] [2019-12-18 15:19:19,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:20,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207573754] [2019-12-18 15:19:20,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:20,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:19:20,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638905098] [2019-12-18 15:19:20,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:19:20,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:19:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:19:20,373 INFO L87 Difference]: Start difference. First operand 202 states and 397 transitions. Second operand 12 states. [2019-12-18 15:19:22,168 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-12-18 15:19:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:22,500 INFO L93 Difference]: Finished difference Result 423 states and 837 transitions. [2019-12-18 15:19:22,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:19:22,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-18 15:19:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:22,503 INFO L225 Difference]: With dead ends: 423 [2019-12-18 15:19:22,503 INFO L226 Difference]: Without dead ends: 401 [2019-12-18 15:19:22,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:19:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-12-18 15:19:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 265. [2019-12-18 15:19:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-18 15:19:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 560 transitions. [2019-12-18 15:19:22,511 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 560 transitions. Word has length 22 [2019-12-18 15:19:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:22,512 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 560 transitions. [2019-12-18 15:19:22,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:19:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 560 transitions. [2019-12-18 15:19:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:22,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:22,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:22,514 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211444, now seen corresponding path program 4 times [2019-12-18 15:19:22,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:22,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264073255] [2019-12-18 15:19:22,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:23,143 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-12-18 15:19:23,287 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2019-12-18 15:19:23,410 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-12-18 15:19:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:23,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264073255] [2019-12-18 15:19:23,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:23,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:23,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844848175] [2019-12-18 15:19:23,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:23,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:23,991 INFO L87 Difference]: Start difference. First operand 265 states and 560 transitions. Second operand 16 states. [2019-12-18 15:19:24,475 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:24,781 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:25,971 INFO L93 Difference]: Finished difference Result 397 states and 812 transitions. [2019-12-18 15:19:25,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:19:25,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:25,974 INFO L225 Difference]: With dead ends: 397 [2019-12-18 15:19:25,974 INFO L226 Difference]: Without dead ends: 397 [2019-12-18 15:19:25,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-18 15:19:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 279. [2019-12-18 15:19:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-18 15:19:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 580 transitions. [2019-12-18 15:19:25,983 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 580 transitions. Word has length 22 [2019-12-18 15:19:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:25,984 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 580 transitions. [2019-12-18 15:19:25,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 580 transitions. [2019-12-18 15:19:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:25,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:25,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:25,985 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:25,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211429, now seen corresponding path program 2 times [2019-12-18 15:19:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:25,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17609901] [2019-12-18 15:19:25,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:26,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17609901] [2019-12-18 15:19:26,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:26,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:19:26,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606607853] [2019-12-18 15:19:26,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:19:26,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:26,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:19:26,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:19:26,430 INFO L87 Difference]: Start difference. First operand 279 states and 580 transitions. Second operand 9 states. [2019-12-18 15:19:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:26,986 INFO L93 Difference]: Finished difference Result 384 states and 770 transitions. [2019-12-18 15:19:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:19:26,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-18 15:19:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:26,989 INFO L225 Difference]: With dead ends: 384 [2019-12-18 15:19:26,989 INFO L226 Difference]: Without dead ends: 376 [2019-12-18 15:19:26,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:19:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-18 15:19:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 321. [2019-12-18 15:19:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 15:19:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 673 transitions. [2019-12-18 15:19:26,997 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 673 transitions. Word has length 22 [2019-12-18 15:19:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:26,998 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 673 transitions. [2019-12-18 15:19:26,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:19:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 673 transitions. [2019-12-18 15:19:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:26,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:26,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:26,999 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:26,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1515700702, now seen corresponding path program 5 times [2019-12-18 15:19:27,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:27,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978243455] [2019-12-18 15:19:27,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:27,312 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-18 15:19:27,428 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-18 15:19:27,553 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-18 15:19:27,746 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-12-18 15:19:27,915 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-12-18 15:19:28,062 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-12-18 15:19:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:28,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978243455] [2019-12-18 15:19:28,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:28,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:28,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516028773] [2019-12-18 15:19:28,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:28,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:28,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:28,568 INFO L87 Difference]: Start difference. First operand 321 states and 673 transitions. Second operand 16 states. [2019-12-18 15:19:29,103 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-18 15:19:29,413 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 15:19:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:30,566 INFO L93 Difference]: Finished difference Result 445 states and 911 transitions. [2019-12-18 15:19:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:19:30,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:30,568 INFO L225 Difference]: With dead ends: 445 [2019-12-18 15:19:30,569 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 15:19:30,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 15:19:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 319. [2019-12-18 15:19:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 15:19:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 668 transitions. [2019-12-18 15:19:30,578 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 668 transitions. Word has length 22 [2019-12-18 15:19:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:30,578 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 668 transitions. [2019-12-18 15:19:30,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 668 transitions. [2019-12-18 15:19:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:30,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:30,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:30,580 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069572, now seen corresponding path program 6 times [2019-12-18 15:19:30,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:30,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244244412] [2019-12-18 15:19:30,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:31,292 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2019-12-18 15:19:31,436 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-12-18 15:19:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:31,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244244412] [2019-12-18 15:19:31,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:31,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:31,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75396603] [2019-12-18 15:19:31,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:31,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:31,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:31,952 INFO L87 Difference]: Start difference. First operand 319 states and 668 transitions. Second operand 16 states. [2019-12-18 15:19:32,439 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:32,743 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:33,885 INFO L93 Difference]: Finished difference Result 443 states and 903 transitions. [2019-12-18 15:19:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:19:33,885 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:33,888 INFO L225 Difference]: With dead ends: 443 [2019-12-18 15:19:33,888 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 15:19:33,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 15:19:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 327. [2019-12-18 15:19:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 15:19:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 674 transitions. [2019-12-18 15:19:33,899 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 674 transitions. Word has length 22 [2019-12-18 15:19:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:33,899 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 674 transitions. [2019-12-18 15:19:33,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 674 transitions. [2019-12-18 15:19:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:33,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:33,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:33,900 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash 718214449, now seen corresponding path program 3 times [2019-12-18 15:19:33,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:33,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885794157] [2019-12-18 15:19:33,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:34,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885794157] [2019-12-18 15:19:34,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:34,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:19:34,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915129406] [2019-12-18 15:19:34,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:19:34,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:19:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:19:34,317 INFO L87 Difference]: Start difference. First operand 327 states and 674 transitions. Second operand 9 states. [2019-12-18 15:19:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:34,854 INFO L93 Difference]: Finished difference Result 405 states and 792 transitions. [2019-12-18 15:19:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:19:34,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-18 15:19:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:34,857 INFO L225 Difference]: With dead ends: 405 [2019-12-18 15:19:34,857 INFO L226 Difference]: Without dead ends: 393 [2019-12-18 15:19:34,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:19:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-18 15:19:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 309. [2019-12-18 15:19:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-18 15:19:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 649 transitions. [2019-12-18 15:19:34,866 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 649 transitions. Word has length 22 [2019-12-18 15:19:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:34,866 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 649 transitions. [2019-12-18 15:19:34,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:19:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 649 transitions. [2019-12-18 15:19:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:34,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:34,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:34,868 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:34,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1341843718, now seen corresponding path program 7 times [2019-12-18 15:19:34,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:34,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27387562] [2019-12-18 15:19:34,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:36,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27387562] [2019-12-18 15:19:36,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:36,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:36,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098378827] [2019-12-18 15:19:36,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:36,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:36,064 INFO L87 Difference]: Start difference. First operand 309 states and 649 transitions. Second operand 16 states. [2019-12-18 15:19:36,542 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:36,847 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:38,196 INFO L93 Difference]: Finished difference Result 464 states and 936 transitions. [2019-12-18 15:19:38,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:19:38,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:38,200 INFO L225 Difference]: With dead ends: 464 [2019-12-18 15:19:38,200 INFO L226 Difference]: Without dead ends: 442 [2019-12-18 15:19:38,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-18 15:19:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 299. [2019-12-18 15:19:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-18 15:19:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 632 transitions. [2019-12-18 15:19:38,209 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 632 transitions. Word has length 22 [2019-12-18 15:19:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:38,209 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 632 transitions. [2019-12-18 15:19:38,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 632 transitions. [2019-12-18 15:19:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:38,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:38,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:38,211 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:38,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1650245952, now seen corresponding path program 8 times [2019-12-18 15:19:38,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:38,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820841609] [2019-12-18 15:19:38,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:38,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820841609] [2019-12-18 15:19:38,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:38,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:19:38,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073098505] [2019-12-18 15:19:38,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:19:38,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:19:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:19:38,450 INFO L87 Difference]: Start difference. First operand 299 states and 632 transitions. Second operand 6 states. [2019-12-18 15:19:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:38,636 INFO L93 Difference]: Finished difference Result 315 states and 656 transitions. [2019-12-18 15:19:38,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:19:38,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:19:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:38,638 INFO L225 Difference]: With dead ends: 315 [2019-12-18 15:19:38,638 INFO L226 Difference]: Without dead ends: 315 [2019-12-18 15:19:38,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:19:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-18 15:19:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-12-18 15:19:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-18 15:19:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 652 transitions. [2019-12-18 15:19:38,645 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 652 transitions. Word has length 22 [2019-12-18 15:19:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:38,645 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 652 transitions. [2019-12-18 15:19:38,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:19:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 652 transitions. [2019-12-18 15:19:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:38,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:38,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:38,647 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:38,647 INFO L82 PathProgramCache]: Analyzing trace with hash -936962176, now seen corresponding path program 9 times [2019-12-18 15:19:38,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:38,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930019675] [2019-12-18 15:19:38,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:39,252 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-12-18 15:19:39,440 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-18 15:19:39,581 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-18 15:19:39,713 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-18 15:19:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:40,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930019675] [2019-12-18 15:19:40,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:40,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:40,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440805666] [2019-12-18 15:19:40,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:40,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:40,270 INFO L87 Difference]: Start difference. First operand 311 states and 652 transitions. Second operand 16 states. [2019-12-18 15:19:40,747 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:41,035 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:41,301 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 15:19:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:41,959 INFO L93 Difference]: Finished difference Result 340 states and 695 transitions. [2019-12-18 15:19:41,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:19:41,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:41,962 INFO L225 Difference]: With dead ends: 340 [2019-12-18 15:19:41,962 INFO L226 Difference]: Without dead ends: 340 [2019-12-18 15:19:41,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-18 15:19:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-12-18 15:19:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-18 15:19:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 695 transitions. [2019-12-18 15:19:41,970 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 695 transitions. Word has length 22 [2019-12-18 15:19:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 695 transitions. [2019-12-18 15:19:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 695 transitions. [2019-12-18 15:19:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:41,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:41,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:41,972 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -936962191, now seen corresponding path program 4 times [2019-12-18 15:19:41,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:41,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473258157] [2019-12-18 15:19:41,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:42,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473258157] [2019-12-18 15:19:42,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:42,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:19:42,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067883922] [2019-12-18 15:19:42,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:19:42,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:19:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:19:42,636 INFO L87 Difference]: Start difference. First operand 339 states and 695 transitions. Second operand 12 states. [2019-12-18 15:19:43,811 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-18 15:19:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:44,197 INFO L93 Difference]: Finished difference Result 535 states and 1007 transitions. [2019-12-18 15:19:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:19:44,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-18 15:19:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:44,200 INFO L225 Difference]: With dead ends: 535 [2019-12-18 15:19:44,201 INFO L226 Difference]: Without dead ends: 507 [2019-12-18 15:19:44,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:19:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-18 15:19:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 337. [2019-12-18 15:19:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-18 15:19:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 700 transitions. [2019-12-18 15:19:44,209 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 700 transitions. Word has length 22 [2019-12-18 15:19:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:44,210 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 700 transitions. [2019-12-18 15:19:44,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:19:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 700 transitions. [2019-12-18 15:19:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:44,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:44,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:44,211 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash 590296588, now seen corresponding path program 10 times [2019-12-18 15:19:44,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:44,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636793988] [2019-12-18 15:19:44,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:45,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636793988] [2019-12-18 15:19:45,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:45,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:45,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992102034] [2019-12-18 15:19:45,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:45,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:45,553 INFO L87 Difference]: Start difference. First operand 337 states and 700 transitions. Second operand 16 states. [2019-12-18 15:19:46,019 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:46,302 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:47,270 INFO L93 Difference]: Finished difference Result 380 states and 773 transitions. [2019-12-18 15:19:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:19:47,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:47,273 INFO L225 Difference]: With dead ends: 380 [2019-12-18 15:19:47,273 INFO L226 Difference]: Without dead ends: 380 [2019-12-18 15:19:47,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-18 15:19:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 365. [2019-12-18 15:19:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-18 15:19:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 746 transitions. [2019-12-18 15:19:47,282 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 746 transitions. Word has length 22 [2019-12-18 15:19:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:47,283 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 746 transitions. [2019-12-18 15:19:47,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 746 transitions. [2019-12-18 15:19:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:47,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:47,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:47,284 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 590296573, now seen corresponding path program 5 times [2019-12-18 15:19:47,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:47,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369505967] [2019-12-18 15:19:47,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:48,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369505967] [2019-12-18 15:19:48,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:48,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:19:48,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512911577] [2019-12-18 15:19:48,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:19:48,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:19:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:19:48,120 INFO L87 Difference]: Start difference. First operand 365 states and 746 transitions. Second operand 12 states. [2019-12-18 15:19:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:49,520 INFO L93 Difference]: Finished difference Result 598 states and 1125 transitions. [2019-12-18 15:19:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:19:49,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-18 15:19:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:49,524 INFO L225 Difference]: With dead ends: 598 [2019-12-18 15:19:49,524 INFO L226 Difference]: Without dead ends: 576 [2019-12-18 15:19:49,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:19:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-18 15:19:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 347. [2019-12-18 15:19:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-18 15:19:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 727 transitions. [2019-12-18 15:19:49,532 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 727 transitions. Word has length 22 [2019-12-18 15:19:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:49,533 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 727 transitions. [2019-12-18 15:19:49,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:19:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 727 transitions. [2019-12-18 15:19:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:49,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:49,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:49,534 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1516658228, now seen corresponding path program 11 times [2019-12-18 15:19:49,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:49,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802909653] [2019-12-18 15:19:49,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:50,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802909653] [2019-12-18 15:19:50,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:50,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:50,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464855430] [2019-12-18 15:19:50,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:50,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:50,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:50,889 INFO L87 Difference]: Start difference. First operand 347 states and 727 transitions. Second operand 16 states. [2019-12-18 15:19:51,338 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:51,624 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:52,651 INFO L93 Difference]: Finished difference Result 388 states and 790 transitions. [2019-12-18 15:19:52,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:19:52,651 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:52,653 INFO L225 Difference]: With dead ends: 388 [2019-12-18 15:19:52,654 INFO L226 Difference]: Without dead ends: 374 [2019-12-18 15:19:52,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-18 15:19:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 351. [2019-12-18 15:19:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-18 15:19:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 733 transitions. [2019-12-18 15:19:52,661 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 733 transitions. Word has length 22 [2019-12-18 15:19:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:52,661 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 733 transitions. [2019-12-18 15:19:52,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 733 transitions. [2019-12-18 15:19:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:52,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:52,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:52,662 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:52,663 INFO L82 PathProgramCache]: Analyzing trace with hash -835410036, now seen corresponding path program 12 times [2019-12-18 15:19:52,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:52,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130678218] [2019-12-18 15:19:52,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:53,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130678218] [2019-12-18 15:19:53,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:53,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:53,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368583545] [2019-12-18 15:19:53,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:53,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:53,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:53,898 INFO L87 Difference]: Start difference. First operand 351 states and 733 transitions. Second operand 16 states. [2019-12-18 15:19:54,365 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-18 15:19:54,641 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 15:19:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:55,523 INFO L93 Difference]: Finished difference Result 380 states and 774 transitions. [2019-12-18 15:19:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:19:55,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:55,533 INFO L225 Difference]: With dead ends: 380 [2019-12-18 15:19:55,533 INFO L226 Difference]: Without dead ends: 364 [2019-12-18 15:19:55,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-12-18 15:19:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 343. [2019-12-18 15:19:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 15:19:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 719 transitions. [2019-12-18 15:19:55,539 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 719 transitions. Word has length 22 [2019-12-18 15:19:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:55,539 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 719 transitions. [2019-12-18 15:19:55,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 719 transitions. [2019-12-18 15:19:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:55,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:55,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:55,541 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:55,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1201713386, now seen corresponding path program 13 times [2019-12-18 15:19:55,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:55,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023436125] [2019-12-18 15:19:55,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:56,249 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-18 15:19:56,417 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-12-18 15:19:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:57,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023436125] [2019-12-18 15:19:57,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:19:57,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:19:57,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379065660] [2019-12-18 15:19:57,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:19:57,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:19:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:19:57,033 INFO L87 Difference]: Start difference. First operand 343 states and 719 transitions. Second operand 16 states. [2019-12-18 15:19:57,500 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:19:57,783 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-18 15:19:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:58,678 INFO L93 Difference]: Finished difference Result 378 states and 776 transitions. [2019-12-18 15:19:58,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:19:58,678 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:19:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:58,680 INFO L225 Difference]: With dead ends: 378 [2019-12-18 15:19:58,680 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 15:19:58,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 15:19:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2019-12-18 15:19:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-18 15:19:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 708 transitions. [2019-12-18 15:19:58,686 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 708 transitions. Word has length 22 [2019-12-18 15:19:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:58,686 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 708 transitions. [2019-12-18 15:19:58,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:19:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 708 transitions. [2019-12-18 15:19:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:19:58,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:58,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:58,688 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:19:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 563733022, now seen corresponding path program 14 times [2019-12-18 15:19:58,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:58,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017651024] [2019-12-18 15:19:58,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:59,230 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-12-18 15:20:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:00,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017651024] [2019-12-18 15:20:00,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:00,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:00,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393917106] [2019-12-18 15:20:00,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:00,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:00,128 INFO L87 Difference]: Start difference. First operand 337 states and 708 transitions. Second operand 16 states. [2019-12-18 15:20:00,641 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-18 15:20:00,941 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-18 15:20:01,202 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-18 15:20:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:01,874 INFO L93 Difference]: Finished difference Result 367 states and 752 transitions. [2019-12-18 15:20:01,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:01,874 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:01,876 INFO L225 Difference]: With dead ends: 367 [2019-12-18 15:20:01,876 INFO L226 Difference]: Without dead ends: 333 [2019-12-18 15:20:01,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-18 15:20:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-12-18 15:20:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-18 15:20:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 700 transitions. [2019-12-18 15:20:01,883 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 700 transitions. Word has length 22 [2019-12-18 15:20:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:01,883 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 700 transitions. [2019-12-18 15:20:01,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 700 transitions. [2019-12-18 15:20:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:01,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:01,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:01,885 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -778198608, now seen corresponding path program 15 times [2019-12-18 15:20:01,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:01,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668846300] [2019-12-18 15:20:01,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:03,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668846300] [2019-12-18 15:20:03,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:03,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:03,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882675937] [2019-12-18 15:20:03,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:03,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:03,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:03,100 INFO L87 Difference]: Start difference. First operand 333 states and 700 transitions. Second operand 16 states. [2019-12-18 15:20:03,859 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 15:20:04,165 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 15:20:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:05,147 INFO L93 Difference]: Finished difference Result 385 states and 778 transitions. [2019-12-18 15:20:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:20:05,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:05,149 INFO L225 Difference]: With dead ends: 385 [2019-12-18 15:20:05,149 INFO L226 Difference]: Without dead ends: 370 [2019-12-18 15:20:05,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-18 15:20:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 328. [2019-12-18 15:20:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 15:20:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 694 transitions. [2019-12-18 15:20:05,155 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 694 transitions. Word has length 22 [2019-12-18 15:20:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:05,156 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 694 transitions. [2019-12-18 15:20:05,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 694 transitions. [2019-12-18 15:20:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:05,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:05,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:05,157 INFO L410 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]=== [2019-12-18 15:20:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2127826590, now seen corresponding path program 16 times [2019-12-18 15:20:05,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330470408] [2019-12-18 15:20:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:05,799 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-12-18 15:20:05,955 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2019-12-18 15:20:06,083 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-12-18 15:20:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:06,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330470408] [2019-12-18 15:20:06,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:06,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:06,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366288766] [2019-12-18 15:20:06,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:06,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:06,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:06,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:06,636 INFO L87 Difference]: Start difference. First operand 328 states and 694 transitions. Second operand 16 states. [2019-12-18 15:20:07,106 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-18 15:20:07,332 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 15:20:07,603 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 15:20:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:08,270 INFO L93 Difference]: Finished difference Result 354 states and 734 transitions. [2019-12-18 15:20:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:08,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:08,272 INFO L225 Difference]: With dead ends: 354 [2019-12-18 15:20:08,272 INFO L226 Difference]: Without dead ends: 321 [2019-12-18 15:20:08,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-18 15:20:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-12-18 15:20:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 15:20:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 686 transitions. [2019-12-18 15:20:08,278 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 686 transitions. Word has length 22 [2019-12-18 15:20:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:08,278 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 686 transitions. [2019-12-18 15:20:08,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 686 transitions. [2019-12-18 15:20:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:08,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:08,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:08,280 INFO L410 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]=== [2019-12-18 15:20:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1866831716, now seen corresponding path program 17 times [2019-12-18 15:20:08,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:08,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736930813] [2019-12-18 15:20:08,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:08,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736930813] [2019-12-18 15:20:08,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:08,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:20:08,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153204189] [2019-12-18 15:20:08,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:20:08,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:08,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:20:08,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:20:08,520 INFO L87 Difference]: Start difference. First operand 321 states and 686 transitions. Second operand 6 states. [2019-12-18 15:20:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:08,669 INFO L93 Difference]: Finished difference Result 102 states and 171 transitions. [2019-12-18 15:20:08,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:20:08,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:20:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:08,670 INFO L225 Difference]: With dead ends: 102 [2019-12-18 15:20:08,670 INFO L226 Difference]: Without dead ends: 102 [2019-12-18 15:20:08,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:20:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-18 15:20:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-18 15:20:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-18 15:20:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 171 transitions. [2019-12-18 15:20:08,673 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 171 transitions. Word has length 22 [2019-12-18 15:20:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:08,674 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 171 transitions. [2019-12-18 15:20:08,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:20:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 171 transitions. [2019-12-18 15:20:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:08,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:08,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:08,675 INFO L410 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]=== [2019-12-18 15:20:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash -720376412, now seen corresponding path program 18 times [2019-12-18 15:20:08,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:08,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300312571] [2019-12-18 15:20:08,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:09,164 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2019-12-18 15:20:09,420 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-18 15:20:09,555 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-18 15:20:09,722 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-18 15:20:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:10,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300312571] [2019-12-18 15:20:10,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:10,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:10,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553037021] [2019-12-18 15:20:10,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:10,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:10,251 INFO L87 Difference]: Start difference. First operand 102 states and 171 transitions. Second operand 16 states. [2019-12-18 15:20:10,703 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-18 15:20:10,923 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-18 15:20:11,163 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-18 15:20:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:11,895 INFO L93 Difference]: Finished difference Result 147 states and 240 transitions. [2019-12-18 15:20:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:11,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:11,896 INFO L225 Difference]: With dead ends: 147 [2019-12-18 15:20:11,896 INFO L226 Difference]: Without dead ends: 108 [2019-12-18 15:20:11,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-18 15:20:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-12-18 15:20:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-18 15:20:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2019-12-18 15:20:11,899 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 22 [2019-12-18 15:20:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:11,900 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2019-12-18 15:20:11,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2019-12-18 15:20:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:11,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:11,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:11,901 INFO L410 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]=== [2019-12-18 15:20:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:11,901 INFO L82 PathProgramCache]: Analyzing trace with hash 806882352, now seen corresponding path program 19 times [2019-12-18 15:20:11,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:11,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55252592] [2019-12-18 15:20:11,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:12,537 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-18 15:20:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:13,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55252592] [2019-12-18 15:20:13,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:13,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:13,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391485779] [2019-12-18 15:20:13,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:13,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:13,306 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 16 states. [2019-12-18 15:20:13,792 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-18 15:20:14,034 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-18 15:20:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:14,919 INFO L93 Difference]: Finished difference Result 177 states and 300 transitions. [2019-12-18 15:20:14,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:14,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:14,921 INFO L225 Difference]: With dead ends: 177 [2019-12-18 15:20:14,921 INFO L226 Difference]: Without dead ends: 147 [2019-12-18 15:20:14,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-18 15:20:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2019-12-18 15:20:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-18 15:20:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 205 transitions. [2019-12-18 15:20:14,924 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 205 transitions. Word has length 22 [2019-12-18 15:20:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:14,924 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 205 transitions. [2019-12-18 15:20:14,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 205 transitions. [2019-12-18 15:20:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:14,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:14,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:14,925 INFO L410 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]=== [2019-12-18 15:20:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1300072464, now seen corresponding path program 20 times [2019-12-18 15:20:14,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:14,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958628888] [2019-12-18 15:20:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:15,487 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-12-18 15:20:15,656 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-18 15:20:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:16,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958628888] [2019-12-18 15:20:16,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:16,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:16,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446985824] [2019-12-18 15:20:16,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:16,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:16,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:16,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:16,365 INFO L87 Difference]: Start difference. First operand 122 states and 205 transitions. Second operand 16 states. [2019-12-18 15:20:16,827 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-18 15:20:17,052 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-18 15:20:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:18,016 INFO L93 Difference]: Finished difference Result 186 states and 304 transitions. [2019-12-18 15:20:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:20:18,016 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:18,017 INFO L225 Difference]: With dead ends: 186 [2019-12-18 15:20:18,017 INFO L226 Difference]: Without dead ends: 166 [2019-12-18 15:20:18,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:20:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-18 15:20:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2019-12-18 15:20:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-18 15:20:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 217 transitions. [2019-12-18 15:20:18,021 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 217 transitions. Word has length 22 [2019-12-18 15:20:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:18,021 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 217 transitions. [2019-12-18 15:20:18,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 217 transitions. [2019-12-18 15:20:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:18,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:18,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:18,022 INFO L410 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]=== [2019-12-18 15:20:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash -618824272, now seen corresponding path program 21 times [2019-12-18 15:20:18,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:18,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645694193] [2019-12-18 15:20:18,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:18,674 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:20:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:19,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645694193] [2019-12-18 15:20:19,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:19,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:19,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866831480] [2019-12-18 15:20:19,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:19,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:19,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:19,324 INFO L87 Difference]: Start difference. First operand 130 states and 217 transitions. Second operand 16 states. [2019-12-18 15:20:19,764 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-18 15:20:19,985 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-18 15:20:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:20,804 INFO L93 Difference]: Finished difference Result 176 states and 282 transitions. [2019-12-18 15:20:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:20:20,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:20,805 INFO L225 Difference]: With dead ends: 176 [2019-12-18 15:20:20,805 INFO L226 Difference]: Without dead ends: 146 [2019-12-18 15:20:20,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-18 15:20:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2019-12-18 15:20:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-18 15:20:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 189 transitions. [2019-12-18 15:20:20,809 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 189 transitions. Word has length 22 [2019-12-18 15:20:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:20,810 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 189 transitions. [2019-12-18 15:20:20,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 189 transitions. [2019-12-18 15:20:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:20,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:20,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:20,811 INFO L410 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]=== [2019-12-18 15:20:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash -985127622, now seen corresponding path program 22 times [2019-12-18 15:20:20,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:20,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354339954] [2019-12-18 15:20:20,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:21,510 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-18 15:20:21,644 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-12-18 15:20:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:22,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354339954] [2019-12-18 15:20:22,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:22,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:22,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771991601] [2019-12-18 15:20:22,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:22,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:22,257 INFO L87 Difference]: Start difference. First operand 114 states and 189 transitions. Second operand 16 states. [2019-12-18 15:20:22,728 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-18 15:20:22,943 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-18 15:20:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:23,841 INFO L93 Difference]: Finished difference Result 167 states and 274 transitions. [2019-12-18 15:20:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:23,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:23,843 INFO L225 Difference]: With dead ends: 167 [2019-12-18 15:20:23,843 INFO L226 Difference]: Without dead ends: 118 [2019-12-18 15:20:23,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-18 15:20:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-12-18 15:20:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-18 15:20:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 167 transitions. [2019-12-18 15:20:23,847 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 167 transitions. Word has length 22 [2019-12-18 15:20:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:23,847 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 167 transitions. [2019-12-18 15:20:23,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 167 transitions. [2019-12-18 15:20:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:23,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:23,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:23,848 INFO L410 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]=== [2019-12-18 15:20:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash 780318786, now seen corresponding path program 23 times [2019-12-18 15:20:23,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:23,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981281945] [2019-12-18 15:20:23,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:24,647 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2019-12-18 15:20:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:25,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981281945] [2019-12-18 15:20:25,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:25,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:25,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29465087] [2019-12-18 15:20:25,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:25,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:25,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:25,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:25,310 INFO L87 Difference]: Start difference. First operand 102 states and 167 transitions. Second operand 16 states. [2019-12-18 15:20:25,790 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-18 15:20:26,020 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-18 15:20:26,253 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-18 15:20:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:27,002 INFO L93 Difference]: Finished difference Result 141 states and 226 transitions. [2019-12-18 15:20:27,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:27,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:27,003 INFO L225 Difference]: With dead ends: 141 [2019-12-18 15:20:27,003 INFO L226 Difference]: Without dead ends: 91 [2019-12-18 15:20:27,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-18 15:20:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-18 15:20:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-18 15:20:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 148 transitions. [2019-12-18 15:20:27,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 148 transitions. Word has length 22 [2019-12-18 15:20:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:27,005 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 148 transitions. [2019-12-18 15:20:27,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 148 transitions. [2019-12-18 15:20:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:27,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:27,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:27,006 INFO L410 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]=== [2019-12-18 15:20:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 799080048, now seen corresponding path program 24 times [2019-12-18 15:20:27,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:27,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524335761] [2019-12-18 15:20:27,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:27,583 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-12-18 15:20:27,719 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-18 15:20:27,851 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-18 15:20:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:28,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524335761] [2019-12-18 15:20:28,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:28,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:28,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163765154] [2019-12-18 15:20:28,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:28,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:28,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:28,540 INFO L87 Difference]: Start difference. First operand 91 states and 148 transitions. Second operand 16 states. [2019-12-18 15:20:29,162 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-18 15:20:29,376 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-18 15:20:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:30,093 INFO L93 Difference]: Finished difference Result 128 states and 205 transitions. [2019-12-18 15:20:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:30,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:30,094 INFO L225 Difference]: With dead ends: 128 [2019-12-18 15:20:30,095 INFO L226 Difference]: Without dead ends: 89 [2019-12-18 15:20:30,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-18 15:20:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-18 15:20:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-18 15:20:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 144 transitions. [2019-12-18 15:20:30,097 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 144 transitions. Word has length 22 [2019-12-18 15:20:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:30,097 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 144 transitions. [2019-12-18 15:20:30,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 144 transitions. [2019-12-18 15:20:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:30,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:30,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:30,098 INFO L410 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]=== [2019-12-18 15:20:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1968628484, now seen corresponding path program 25 times [2019-12-18 15:20:30,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:30,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695027066] [2019-12-18 15:20:30,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:30,679 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:20:30,809 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-18 15:20:30,939 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-18 15:20:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:31,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695027066] [2019-12-18 15:20:31,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:31,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:31,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962303162] [2019-12-18 15:20:31,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:31,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:31,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:31,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:31,606 INFO L87 Difference]: Start difference. First operand 89 states and 144 transitions. Second operand 16 states. [2019-12-18 15:20:32,285 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-18 15:20:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:33,228 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2019-12-18 15:20:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:33,229 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:33,230 INFO L225 Difference]: With dead ends: 158 [2019-12-18 15:20:33,230 INFO L226 Difference]: Without dead ends: 128 [2019-12-18 15:20:33,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-18 15:20:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2019-12-18 15:20:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-18 15:20:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 172 transitions. [2019-12-18 15:20:33,233 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 172 transitions. Word has length 22 [2019-12-18 15:20:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:33,233 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 172 transitions. [2019-12-18 15:20:33,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 172 transitions. [2019-12-18 15:20:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:33,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:33,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:33,234 INFO L410 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]=== [2019-12-18 15:20:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash 219383996, now seen corresponding path program 26 times [2019-12-18 15:20:33,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:33,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921097776] [2019-12-18 15:20:33,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:33,824 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-18 15:20:33,959 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-18 15:20:34,094 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-18 15:20:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:34,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921097776] [2019-12-18 15:20:34,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:34,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:34,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361251320] [2019-12-18 15:20:34,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:34,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:34,738 INFO L87 Difference]: Start difference. First operand 105 states and 172 transitions. Second operand 16 states. [2019-12-18 15:20:35,416 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-18 15:20:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:36,402 INFO L93 Difference]: Finished difference Result 167 states and 269 transitions. [2019-12-18 15:20:36,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:20:36,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:36,404 INFO L225 Difference]: With dead ends: 167 [2019-12-18 15:20:36,404 INFO L226 Difference]: Without dead ends: 147 [2019-12-18 15:20:36,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:20:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-18 15:20:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2019-12-18 15:20:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-18 15:20:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 184 transitions. [2019-12-18 15:20:36,407 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 184 transitions. Word has length 22 [2019-12-18 15:20:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:36,408 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 184 transitions. [2019-12-18 15:20:36,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 184 transitions. [2019-12-18 15:20:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:36,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:36,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:36,409 INFO L410 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]=== [2019-12-18 15:20:36,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 900632188, now seen corresponding path program 27 times [2019-12-18 15:20:36,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:36,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306797971] [2019-12-18 15:20:36,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:36,684 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-18 15:20:37,038 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:20:37,180 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:20:37,309 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-18 15:20:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:37,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306797971] [2019-12-18 15:20:37,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:37,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:37,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999551401] [2019-12-18 15:20:37,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:37,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:37,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:37,841 INFO L87 Difference]: Start difference. First operand 113 states and 184 transitions. Second operand 16 states. [2019-12-18 15:20:38,525 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-18 15:20:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:39,359 INFO L93 Difference]: Finished difference Result 157 states and 247 transitions. [2019-12-18 15:20:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:20:39,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:39,361 INFO L225 Difference]: With dead ends: 157 [2019-12-18 15:20:39,361 INFO L226 Difference]: Without dead ends: 127 [2019-12-18 15:20:39,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-18 15:20:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 97. [2019-12-18 15:20:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-18 15:20:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 156 transitions. [2019-12-18 15:20:39,364 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 156 transitions. Word has length 22 [2019-12-18 15:20:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:39,364 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 156 transitions. [2019-12-18 15:20:39,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 156 transitions. [2019-12-18 15:20:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:39,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:39,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:39,365 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 534328838, now seen corresponding path program 28 times [2019-12-18 15:20:39,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:39,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172743976] [2019-12-18 15:20:39,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:39,569 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-18 15:20:39,702 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-18 15:20:39,913 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2019-12-18 15:20:40,067 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-12-18 15:20:40,211 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-18 15:20:40,341 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-18 15:20:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:40,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172743976] [2019-12-18 15:20:40,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:40,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:40,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576178490] [2019-12-18 15:20:40,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:40,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:40,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:40,976 INFO L87 Difference]: Start difference. First operand 97 states and 156 transitions. Second operand 16 states. [2019-12-18 15:20:41,666 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-18 15:20:42,092 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-12-18 15:20:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:42,609 INFO L93 Difference]: Finished difference Result 134 states and 213 transitions. [2019-12-18 15:20:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:42,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:42,610 INFO L225 Difference]: With dead ends: 134 [2019-12-18 15:20:42,611 INFO L226 Difference]: Without dead ends: 85 [2019-12-18 15:20:42,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-18 15:20:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-18 15:20:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-18 15:20:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 136 transitions. [2019-12-18 15:20:42,613 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 136 transitions. Word has length 22 [2019-12-18 15:20:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:42,614 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 136 transitions. [2019-12-18 15:20:42,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2019-12-18 15:20:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:42,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:42,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:42,615 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1929190334, now seen corresponding path program 29 times [2019-12-18 15:20:42,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:42,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229048652] [2019-12-18 15:20:42,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:43,170 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:20:43,422 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-18 15:20:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:44,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229048652] [2019-12-18 15:20:44,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:44,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:44,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467988947] [2019-12-18 15:20:44,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:44,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:44,061 INFO L87 Difference]: Start difference. First operand 85 states and 136 transitions. Second operand 16 states. [2019-12-18 15:20:45,126 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-18 15:20:45,396 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-18 15:20:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:45,693 INFO L93 Difference]: Finished difference Result 120 states and 191 transitions. [2019-12-18 15:20:45,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:45,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:45,694 INFO L225 Difference]: With dead ends: 120 [2019-12-18 15:20:45,694 INFO L226 Difference]: Without dead ends: 90 [2019-12-18 15:20:45,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-18 15:20:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-12-18 15:20:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-18 15:20:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2019-12-18 15:20:45,696 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 22 [2019-12-18 15:20:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:45,697 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2019-12-18 15:20:45,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2019-12-18 15:20:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:45,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:45,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:45,697 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash -177764482, now seen corresponding path program 30 times [2019-12-18 15:20:45,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:45,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101356576] [2019-12-18 15:20:45,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:46,226 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-12-18 15:20:46,360 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2019-12-18 15:20:46,488 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 27 [2019-12-18 15:20:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:47,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101356576] [2019-12-18 15:20:47,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:47,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:47,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863821863] [2019-12-18 15:20:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:47,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:47,136 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand 16 states. [2019-12-18 15:20:48,127 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-18 15:20:48,384 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-18 15:20:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:48,804 INFO L93 Difference]: Finished difference Result 114 states and 172 transitions. [2019-12-18 15:20:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:20:48,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:48,805 INFO L225 Difference]: With dead ends: 114 [2019-12-18 15:20:48,805 INFO L226 Difference]: Without dead ends: 94 [2019-12-18 15:20:48,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:20:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-18 15:20:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-12-18 15:20:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-18 15:20:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2019-12-18 15:20:48,807 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 22 [2019-12-18 15:20:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:48,807 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2019-12-18 15:20:48,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2019-12-18 15:20:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:48,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:48,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:48,809 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 503483710, now seen corresponding path program 31 times [2019-12-18 15:20:48,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:48,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795550814] [2019-12-18 15:20:48,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:49,349 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:20:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:50,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795550814] [2019-12-18 15:20:50,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:50,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:50,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253184491] [2019-12-18 15:20:50,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:50,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:50,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:50,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:50,114 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand 16 states. [2019-12-18 15:20:50,933 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-18 15:20:51,110 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-18 15:20:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:51,595 INFO L93 Difference]: Finished difference Result 104 states and 150 transitions. [2019-12-18 15:20:51,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:20:51,596 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:51,597 INFO L225 Difference]: With dead ends: 104 [2019-12-18 15:20:51,597 INFO L226 Difference]: Without dead ends: 74 [2019-12-18 15:20:51,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-18 15:20:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2019-12-18 15:20:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-18 15:20:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2019-12-18 15:20:51,600 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 22 [2019-12-18 15:20:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:51,600 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2019-12-18 15:20:51,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2019-12-18 15:20:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:51,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:51,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:51,601 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash -3039712, now seen corresponding path program 32 times [2019-12-18 15:20:51,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:51,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505116086] [2019-12-18 15:20:51,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:52,196 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-12-18 15:20:52,320 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-18 15:20:52,451 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-18 15:20:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:53,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505116086] [2019-12-18 15:20:53,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:53,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:20:53,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436169105] [2019-12-18 15:20:53,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:20:53,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:53,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:20:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:20:53,092 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 16 states. [2019-12-18 15:20:54,055 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-12-18 15:20:54,268 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-18 15:20:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:54,483 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2019-12-18 15:20:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:20:54,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-18 15:20:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:54,483 INFO L225 Difference]: With dead ends: 64 [2019-12-18 15:20:54,483 INFO L226 Difference]: Without dead ends: 0 [2019-12-18 15:20:54,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-18 15:20:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-18 15:20:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-18 15:20:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-18 15:20:54,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-18 15:20:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:54,484 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-18 15:20:54,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:20:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-18 15:20:54,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-18 15:20:54,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:20:54 BasicIcfg [2019-12-18 15:20:54,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:20:54,490 INFO L168 Benchmark]: Toolchain (without parser) took 170820.44 ms. Allocated memory was 148.4 MB in the beginning and 248.0 MB in the end (delta: 99.6 MB). Free memory was 102.5 MB in the beginning and 142.4 MB in the end (delta: -39.9 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:54,490 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 148.4 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 15:20:54,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1448.84 ms. Allocated memory was 148.4 MB in the beginning and 234.4 MB in the end (delta: 86.0 MB). Free memory was 102.3 MB in the beginning and 161.1 MB in the end (delta: -58.8 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:54,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.16 ms. Allocated memory is still 234.4 MB. Free memory was 161.1 MB in the beginning and 158.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:54,491 INFO L168 Benchmark]: Boogie Preprocessor took 46.14 ms. Allocated memory is still 234.4 MB. Free memory was 158.4 MB in the beginning and 155.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:54,492 INFO L168 Benchmark]: RCFGBuilder took 852.09 ms. Allocated memory is still 234.4 MB. Free memory was 155.7 MB in the beginning and 107.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:54,492 INFO L168 Benchmark]: TraceAbstraction took 168376.04 ms. Allocated memory was 234.4 MB in the beginning and 248.0 MB in the end (delta: 13.6 MB). Free memory was 107.3 MB in the beginning and 142.4 MB in the end (delta: -35.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:20:54,493 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 148.4 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1448.84 ms. Allocated memory was 148.4 MB in the beginning and 234.4 MB in the end (delta: 86.0 MB). Free memory was 102.3 MB in the beginning and 161.1 MB in the end (delta: -58.8 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.16 ms. Allocated memory is still 234.4 MB. Free memory was 161.1 MB in the beginning and 158.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.14 ms. Allocated memory is still 234.4 MB. Free memory was 158.4 MB in the beginning and 155.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.09 ms. Allocated memory is still 234.4 MB. Free memory was 155.7 MB in the beginning and 107.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 168376.04 ms. Allocated memory was 234.4 MB in the beginning and 248.0 MB in the end (delta: 13.6 MB). Free memory was 107.3 MB in the beginning and 142.4 MB in the end (delta: -35.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 61.8s, 151 ProgramPointsBefore, 41 ProgramPointsAfterwards, 155 TransitionsBefore, 41 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 16 ConcurrentYvCompositions, 5 ChoiceCompositions, 1460 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 49.2s, 0 MoverChecksTotal, 5217 CheckedPairsTotal, 160 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 168.2s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 58.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1022 SDtfs, 2344 SDslu, 5132 SDs, 0 SdLazy, 15150 SolverSat, 1056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 871 GetRequests, 28 SyntacticMatches, 92 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 66.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred 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.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 1895 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 45.1s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 389053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...