/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-4336eb1 [2019-12-27 00:22:17,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:22:17,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:22:17,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:22:17,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:22:17,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:22:17,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:22:17,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:22:17,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:22:17,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:22:17,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:22:17,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:22:17,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:22:17,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:22:17,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:22:17,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:22:17,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:22:17,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:22:17,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:22:17,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:22:17,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:22:17,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:22:17,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:22:17,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:22:17,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:22:17,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:22:17,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:22:17,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:22:17,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:22:17,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:22:17,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:22:17,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:22:17,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:22:17,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:22:17,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:22:17,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:22:17,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:22:17,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:22:17,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:22:17,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:22:17,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:22:17,580 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-27 00:22:17,616 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:22:17,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:22:17,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:22:17,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:22:17,623 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:22:17,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:22:17,624 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:22:17,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:22:17,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:22:17,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:22:17,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:22:17,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:22:17,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:22:17,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:22:17,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:22:17,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:22:17,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:22:17,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:22:17,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:22:17,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:22:17,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:22:17,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:22:17,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:22:17,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:22:17,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:22:17,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:22:17,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:22:17,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:22:17,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:22:17,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:22:17,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:22:17,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:22:17,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:22:17,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:22:17,954 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:22:17,955 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-27 00:22:18,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf318bda/249721726c764646877b8d61868c1b60/FLAG396f42a16 [2019-12-27 00:22:18,615 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:22:18,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2019-12-27 00:22:18,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf318bda/249721726c764646877b8d61868c1b60/FLAG396f42a16 [2019-12-27 00:22:18,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf318bda/249721726c764646877b8d61868c1b60 [2019-12-27 00:22:18,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:22:18,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:22:18,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:22:18,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:22:18,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:22:18,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:22:18" (1/1) ... [2019-12-27 00:22:18,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a801cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:18, skipping insertion in model container [2019-12-27 00:22:18,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:22:18" (1/1) ... [2019-12-27 00:22:18,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:22:18,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:22:19,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:22:19,848 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:22:19,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:22:20,286 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:22:20,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20 WrapperNode [2019-12-27 00:22:20,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:22:20,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:22:20,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:22:20,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:22:20,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:22:20,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:22:20,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:22:20,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:22:20,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... [2019-12-27 00:22:20,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:22:20,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:22:20,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:22:20,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:22:20,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:22:20,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:22:20,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:22:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 00:22:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 00:22:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:22:20,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:22:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 00:22:20,491 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 00:22:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:22:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:22:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 00:22:20,494 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:22:21,354 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:22:21,354 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 00:22:21,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:22:21 BoogieIcfgContainer [2019-12-27 00:22:21,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:22:21,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:22:21,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:22:21,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:22:21,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:22:18" (1/3) ... [2019-12-27 00:22:21,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d1cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:22:21, skipping insertion in model container [2019-12-27 00:22:21,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:22:20" (2/3) ... [2019-12-27 00:22:21,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d1cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:22:21, skipping insertion in model container [2019-12-27 00:22:21,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:22:21" (3/3) ... [2019-12-27 00:22:21,364 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2019-12-27 00:22:21,374 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:22:21,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:22:21,382 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 00:22:21,383 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:22:21,415 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,416 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,416 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,416 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,417 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,417 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,417 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,417 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,418 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,418 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,418 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,418 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,418 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,419 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,419 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,419 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,419 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,420 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,420 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,420 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,420 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,421 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,421 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,421 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,421 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,422 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,422 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,422 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,422 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,423 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,423 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,423 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,423 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,424 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,424 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,425 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,425 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,425 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,425 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,426 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,427 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,427 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,427 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,427 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,428 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,428 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,428 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,428 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,428 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,429 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,429 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,429 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,429 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,430 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,430 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,430 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,431 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,431 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,431 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,431 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,431 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,432 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,432 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,432 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,433 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,433 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,437 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,437 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,437 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,438 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,438 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,438 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,438 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,439 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,439 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,439 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,439 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,440 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,447 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,447 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,447 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,448 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,448 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,448 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,448 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,449 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,449 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,449 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,449 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,449 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:22:21,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 00:22:21,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:22:21,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:22:21,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:22:21,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:22:21,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:22:21,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:22:21,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:22:21,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:22:21,524 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions [2019-12-27 00:22:21,526 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-27 00:22:21,649 INFO L132 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-27 00:22:21,650 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:22:21,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 00:22:21,678 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-27 00:22:21,720 INFO L132 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-27 00:22:21,720 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:22:21,723 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 00:22:21,730 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2884 [2019-12-27 00:22:21,731 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:22:21,944 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:21,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:21,999 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:22,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:22,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:22,037 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:22:22,059 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:22,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:22,104 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:22,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:22,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-27 00:22:22,141 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:22:24,224 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:24,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:24,283 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:24,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:24,318 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:24,318 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:22:24,335 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:24,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:24,380 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:24,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:24,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:24,417 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:26,864 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:26,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:26,910 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:26,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:26,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:26,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:22:26,959 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:26,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:27,000 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:27,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:27,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:27,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:29,169 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:29,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:29,237 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:29,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:29,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:29,263 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:22:29,295 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:29,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:29,339 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:29,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:29,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:29,380 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:22:31,686 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:31,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:31,735 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:31,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:31,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:31,771 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:31,802 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:31,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:31,845 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:31,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:31,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:31,884 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:22:34,662 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:34,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:34,706 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:34,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:34,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:34,742 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:22:34,764 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:34,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:34,816 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:34,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:34,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:34,858 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 00:22:36,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-27 00:22:36,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:36,925 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:36,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:36,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-27 00:22:36,980 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:36,996 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:37,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:37,032 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:37,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:37,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:37,069 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:22:39,098 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:39,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:39,146 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:39,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:39,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:39,177 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:22:39,192 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:39,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:39,229 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:39,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:39,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:39,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:41,638 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:41,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:41,677 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:41,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:41,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:41,711 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:22:41,727 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:41,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:41,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-27 00:22:41,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:41,803 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:41,804 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 00:22:44,132 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:44,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:44,184 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:44,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:44,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:44,229 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 00:22:44,245 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:44,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:44,299 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:44,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:44,330 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:44,331 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:22:46,645 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:46,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:46,694 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:46,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:46,725 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:46,725 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:46,736 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:46,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:46,778 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:46,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:46,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:46,815 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:49,333 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:49,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:49,378 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:49,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:49,414 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:49,414 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:49,427 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:49,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:49,497 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:49,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:49,537 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:49,537 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:51,554 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:51,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:51,598 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:51,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:51,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:51,634 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:51,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-27 00:22:51,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:51,693 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:51,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:51,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:51,753 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:53,931 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:53,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:53,970 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:54,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:54,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:54,003 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:54,020 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:54,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:54,081 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:54,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:54,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:54,119 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:56,586 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:56,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:56,623 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:56,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:56,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:56,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:22:56,666 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:56,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:56,703 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:56,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:56,733 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:56,734 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:58,899 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:58,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:58,949 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:58,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:59,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:59,000 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:22:59,018 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:59,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:59,092 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:59,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:22:59,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:22:59,157 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:23:01,245 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:01,282 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:01,308 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,308 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 00:23:01,408 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:01,449 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:01,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,506 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:23:01,520 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:01,559 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:01,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:01,587 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:23:04,024 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:04,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:04,058 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:04,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:04,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:04,084 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:23:04,095 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:04,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:04,130 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:04,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:04,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:04,157 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-27 00:23:06,212 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,262 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,300 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 00:23:06,314 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,360 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,399 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-27 00:23:06,419 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,467 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,504 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:23:06,519 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,566 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:06,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:06,600 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:23:08,718 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:08,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:08,757 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:08,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:08,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:08,785 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 00:23:08,797 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:08,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:08,835 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:08,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:08,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:08,862 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-27 00:23:10,980 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:11,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:11,017 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:11,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:11,041 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:11,041 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-27 00:23:11,052 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:11,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:11,085 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:11,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:11,110 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:11,110 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 00:23:13,503 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-27 00:23:13,732 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 00:23:13,860 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 00:23:14,432 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 00:23:14,513 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,550 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,579 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-27 00:23:14,591 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,628 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,656 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-27 00:23:14,670 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,705 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:23:14,746 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,780 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:14,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:14,816 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:23:17,124 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-27 00:23:17,343 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 00:23:17,945 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-12-27 00:23:18,117 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-27 00:23:18,840 WARN L192 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-12-27 00:23:18,870 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:19,299 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-27 00:23:19,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:19,312 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:19,757 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 00:23:19,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:19,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:19,759 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2019-12-27 00:23:20,079 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 00:23:21,329 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2019-12-27 00:23:21,348 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:22,118 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 00:23:22,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:22,130 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:22,693 WARN L192 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 00:23:22,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:23:22,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 00:23:22,695 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-27 00:23:23,162 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 00:23:23,494 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-27 00:23:23,803 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-27 00:23:23,813 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5217 [2019-12-27 00:23:23,814 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-27 00:23:23,817 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions [2019-12-27 00:23:23,845 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 462 states. [2019-12-27 00:23:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-12-27 00:23:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 00:23:23,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:23,853 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 00:23:23,854 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:23,859 INFO L82 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2019-12-27 00:23:23,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:23,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857788581] [2019-12-27 00:23:23,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:24,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857788581] [2019-12-27 00:23:24,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:24,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 00:23:24,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173465961] [2019-12-27 00:23:24,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 00:23:24,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 00:23:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 00:23:24,151 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 2 states. [2019-12-27 00:23:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:24,190 INFO L93 Difference]: Finished difference Result 460 states and 1126 transitions. [2019-12-27 00:23:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 00:23:24,191 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 00:23:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:24,207 INFO L225 Difference]: With dead ends: 460 [2019-12-27 00:23:24,208 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 00:23:24,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 00:23:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 00:23:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-12-27 00:23:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-27 00:23:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2019-12-27 00:23:24,289 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2019-12-27 00:23:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:24,289 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2019-12-27 00:23:24,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 00:23:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2019-12-27 00:23:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:23:24,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:24,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:23:24,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 17095183, now seen corresponding path program 1 times [2019-12-27 00:23:24,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:24,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664948919] [2019-12-27 00:23:24,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:24,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664948919] [2019-12-27 00:23:24,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:24,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:23:24,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971004059] [2019-12-27 00:23:24,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:23:24,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:23:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:23:24,539 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2019-12-27 00:23:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:24,711 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2019-12-27 00:23:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:23:24,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:23:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:24,718 INFO L225 Difference]: With dead ends: 540 [2019-12-27 00:23:24,718 INFO L226 Difference]: Without dead ends: 540 [2019-12-27 00:23:24,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:23:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-27 00:23:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2019-12-27 00:23:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-27 00:23:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2019-12-27 00:23:24,753 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2019-12-27 00:23:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:24,753 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2019-12-27 00:23:24,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:23:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2019-12-27 00:23:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 00:23:24,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:24,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 00:23:24,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -751398463, now seen corresponding path program 1 times [2019-12-27 00:23:24,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:24,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606934114] [2019-12-27 00:23:24,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:24,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606934114] [2019-12-27 00:23:24,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:24,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:23:24,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724434824] [2019-12-27 00:23:24,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:23:24,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:23:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:23:24,847 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2019-12-27 00:23:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:25,055 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2019-12-27 00:23:25,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:23:25,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-27 00:23:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:25,060 INFO L225 Difference]: With dead ends: 599 [2019-12-27 00:23:25,060 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 00:23:25,060 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-27 00:23:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 00:23:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2019-12-27 00:23:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 00:23:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2019-12-27 00:23:25,082 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2019-12-27 00:23:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:25,083 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2019-12-27 00:23:25,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:23:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2019-12-27 00:23:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:23:25,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:25,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:25,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1452138275, now seen corresponding path program 1 times [2019-12-27 00:23:25,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:25,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916360121] [2019-12-27 00:23:25,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:25,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916360121] [2019-12-27 00:23:25,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:25,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:23:25,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794834910] [2019-12-27 00:23:25,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:23:25,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:23:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:23:25,188 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2019-12-27 00:23:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:25,206 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2019-12-27 00:23:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:23:25,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 00:23:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:25,210 INFO L225 Difference]: With dead ends: 162 [2019-12-27 00:23:25,210 INFO L226 Difference]: Without dead ends: 162 [2019-12-27 00:23:25,211 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-27 00:23:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-27 00:23:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-27 00:23:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 00:23:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-27 00:23:25,216 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-27 00:23:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:25,217 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-27 00:23:25,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:23:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-27 00:23:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:25,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:25,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:25,226 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2124244464, now seen corresponding path program 1 times [2019-12-27 00:23:25,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:25,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645693100] [2019-12-27 00:23:25,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:25,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645693100] [2019-12-27 00:23:25,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:25,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:23:25,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816434608] [2019-12-27 00:23:25,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:23:25,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:23:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:23:25,556 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2019-12-27 00:23:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:25,731 INFO L93 Difference]: Finished difference Result 186 states and 379 transitions. [2019-12-27 00:23:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:23:25,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:23:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:25,734 INFO L225 Difference]: With dead ends: 186 [2019-12-27 00:23:25,734 INFO L226 Difference]: Without dead ends: 186 [2019-12-27 00:23:25,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:23:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-27 00:23:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2019-12-27 00:23:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 00:23:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 335 transitions. [2019-12-27 00:23:25,739 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 335 transitions. Word has length 22 [2019-12-27 00:23:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:25,740 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 335 transitions. [2019-12-27 00:23:25,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:23:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 335 transitions. [2019-12-27 00:23:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:25,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:25,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:25,742 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash 732163342, now seen corresponding path program 1 times [2019-12-27 00:23:25,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:25,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193385565] [2019-12-27 00:23:25,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:25,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193385565] [2019-12-27 00:23:25,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:25,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:23:25,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552431081] [2019-12-27 00:23:25,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:23:25,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:23:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:23:25,917 INFO L87 Difference]: Start difference. First operand 162 states and 335 transitions. Second operand 5 states. [2019-12-27 00:23:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:26,140 INFO L93 Difference]: Finished difference Result 206 states and 412 transitions. [2019-12-27 00:23:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:23:26,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 00:23:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:26,143 INFO L225 Difference]: With dead ends: 206 [2019-12-27 00:23:26,143 INFO L226 Difference]: Without dead ends: 206 [2019-12-27 00:23:26,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:23:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-27 00:23:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2019-12-27 00:23:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-27 00:23:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-27 00:23:26,150 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-27 00:23:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:26,150 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-27 00:23:26,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:23:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-27 00:23:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:26,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:26,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:26,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash -55183662, now seen corresponding path program 2 times [2019-12-27 00:23:26,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:26,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344156882] [2019-12-27 00:23:26,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:27,171 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-12-27 00:23:27,339 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-12-27 00:23:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:27,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344156882] [2019-12-27 00:23:27,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:27,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:27,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004556111] [2019-12-27 00:23:27,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:27,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:27,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:27,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:27,869 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 16 states. [2019-12-27 00:23:28,401 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:23:28,749 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 00:23:29,056 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 00:23:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:30,222 INFO L93 Difference]: Finished difference Result 301 states and 558 transitions. [2019-12-27 00:23:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:23:30,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:30,225 INFO L225 Difference]: With dead ends: 301 [2019-12-27 00:23:30,225 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 00:23:30,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:23:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 00:23:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 235. [2019-12-27 00:23:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-27 00:23:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 447 transitions. [2019-12-27 00:23:30,235 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 447 transitions. Word has length 22 [2019-12-27 00:23:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:30,235 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 447 transitions. [2019-12-27 00:23:30,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 447 transitions. [2019-12-27 00:23:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:30,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:30,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:30,237 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:30,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash -55183677, now seen corresponding path program 1 times [2019-12-27 00:23:30,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:30,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675189636] [2019-12-27 00:23:30,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:30,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675189636] [2019-12-27 00:23:30,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:30,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:30,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240885967] [2019-12-27 00:23:30,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:30,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:30,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:30,800 INFO L87 Difference]: Start difference. First operand 235 states and 447 transitions. Second operand 9 states. [2019-12-27 00:23:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:31,444 INFO L93 Difference]: Finished difference Result 321 states and 587 transitions. [2019-12-27 00:23:31,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:23:31,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 00:23:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:31,446 INFO L225 Difference]: With dead ends: 321 [2019-12-27 00:23:31,446 INFO L226 Difference]: Without dead ends: 279 [2019-12-27 00:23:31,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:23:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-27 00:23:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2019-12-27 00:23:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-27 00:23:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 453 transitions. [2019-12-27 00:23:31,453 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 453 transitions. Word has length 22 [2019-12-27 00:23:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:31,454 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 453 transitions. [2019-12-27 00:23:31,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 453 transitions. [2019-12-27 00:23:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:31,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:31,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:31,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:31,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1284449614, now seen corresponding path program 2 times [2019-12-27 00:23:31,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:31,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041697836] [2019-12-27 00:23:31,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:31,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041697836] [2019-12-27 00:23:31,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:31,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:23:31,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227679042] [2019-12-27 00:23:31,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:23:31,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:31,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:23:31,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:23:31,664 INFO L87 Difference]: Start difference. First operand 235 states and 453 transitions. Second operand 6 states. [2019-12-27 00:23:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:32,160 INFO L93 Difference]: Finished difference Result 242 states and 463 transitions. [2019-12-27 00:23:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:23:32,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:23:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:32,162 INFO L225 Difference]: With dead ends: 242 [2019-12-27 00:23:32,162 INFO L226 Difference]: Without dead ends: 242 [2019-12-27 00:23:32,162 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-27 00:23:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-27 00:23:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2019-12-27 00:23:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-27 00:23:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 398 transitions. [2019-12-27 00:23:32,168 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 398 transitions. Word has length 22 [2019-12-27 00:23:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:32,169 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 398 transitions. [2019-12-27 00:23:32,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:23:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 398 transitions. [2019-12-27 00:23:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:32,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:32,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:32,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:32,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash 497102610, now seen corresponding path program 3 times [2019-12-27 00:23:32,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:32,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910360533] [2019-12-27 00:23:32,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:32,405 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-27 00:23:32,526 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-27 00:23:32,867 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-12-27 00:23:33,052 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-12-27 00:23:33,247 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-12-27 00:23:33,434 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-12-27 00:23:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:33,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910360533] [2019-12-27 00:23:33,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:33,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:33,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060584089] [2019-12-27 00:23:33,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:33,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:33,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:33,873 INFO L87 Difference]: Start difference. First operand 202 states and 398 transitions. Second operand 16 states. [2019-12-27 00:23:34,349 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:23:34,661 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:23:34,926 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 00:23:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:36,160 INFO L93 Difference]: Finished difference Result 308 states and 587 transitions. [2019-12-27 00:23:36,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:23:36,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:36,163 INFO L225 Difference]: With dead ends: 308 [2019-12-27 00:23:36,164 INFO L226 Difference]: Without dead ends: 295 [2019-12-27 00:23:36,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-12-27 00:23:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-27 00:23:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 202. [2019-12-27 00:23:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-27 00:23:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 397 transitions. [2019-12-27 00:23:36,170 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 397 transitions. Word has length 22 [2019-12-27 00:23:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:36,171 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 397 transitions. [2019-12-27 00:23:36,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 397 transitions. [2019-12-27 00:23:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:36,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:36,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:36,172 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2050812348, now seen corresponding path program 3 times [2019-12-27 00:23:36,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:36,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267104164] [2019-12-27 00:23:36,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:36,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267104164] [2019-12-27 00:23:36,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:36,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:23:36,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056366057] [2019-12-27 00:23:36,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:23:36,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:36,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:23:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:23:36,736 INFO L87 Difference]: Start difference. First operand 202 states and 397 transitions. Second operand 12 states. [2019-12-27 00:23:38,580 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-27 00:23:38,808 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-12-27 00:23:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:39,148 INFO L93 Difference]: Finished difference Result 423 states and 837 transitions. [2019-12-27 00:23:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:23:39,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-27 00:23:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:39,151 INFO L225 Difference]: With dead ends: 423 [2019-12-27 00:23:39,151 INFO L226 Difference]: Without dead ends: 401 [2019-12-27 00:23:39,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:23:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-12-27 00:23:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 265. [2019-12-27 00:23:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-27 00:23:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 560 transitions. [2019-12-27 00:23:39,159 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 560 transitions. Word has length 22 [2019-12-27 00:23:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:39,159 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 560 transitions. [2019-12-27 00:23:39,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:23:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 560 transitions. [2019-12-27 00:23:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:39,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:39,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:39,161 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211444, now seen corresponding path program 4 times [2019-12-27 00:23:39,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:39,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577844050] [2019-12-27 00:23:39,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:39,511 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-27 00:23:39,639 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-27 00:23:39,887 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-12-27 00:23:40,041 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2019-12-27 00:23:40,173 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-12-27 00:23:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:40,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577844050] [2019-12-27 00:23:40,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:40,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:40,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758344269] [2019-12-27 00:23:40,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:40,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:40,765 INFO L87 Difference]: Start difference. First operand 265 states and 560 transitions. Second operand 16 states. [2019-12-27 00:23:41,251 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:23:41,578 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:23:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:42,864 INFO L93 Difference]: Finished difference Result 397 states and 812 transitions. [2019-12-27 00:23:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:23:42,865 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:42,867 INFO L225 Difference]: With dead ends: 397 [2019-12-27 00:23:42,867 INFO L226 Difference]: Without dead ends: 397 [2019-12-27 00:23:42,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:23:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-27 00:23:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 279. [2019-12-27 00:23:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-27 00:23:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 580 transitions. [2019-12-27 00:23:42,876 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 580 transitions. Word has length 22 [2019-12-27 00:23:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:42,876 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 580 transitions. [2019-12-27 00:23:42,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 580 transitions. [2019-12-27 00:23:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:42,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:42,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:42,878 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211429, now seen corresponding path program 2 times [2019-12-27 00:23:42,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:42,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588496047] [2019-12-27 00:23:42,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:43,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588496047] [2019-12-27 00:23:43,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:43,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376433854] [2019-12-27 00:23:43,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:43,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:43,435 INFO L87 Difference]: Start difference. First operand 279 states and 580 transitions. Second operand 9 states. [2019-12-27 00:23:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:43,939 INFO L93 Difference]: Finished difference Result 384 states and 770 transitions. [2019-12-27 00:23:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:23:43,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 00:23:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:43,942 INFO L225 Difference]: With dead ends: 384 [2019-12-27 00:23:43,942 INFO L226 Difference]: Without dead ends: 376 [2019-12-27 00:23:43,943 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-27 00:23:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-27 00:23:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 321. [2019-12-27 00:23:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 00:23:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 673 transitions. [2019-12-27 00:23:43,950 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 673 transitions. Word has length 22 [2019-12-27 00:23:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:43,950 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 673 transitions. [2019-12-27 00:23:43,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 673 transitions. [2019-12-27 00:23:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:43,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:43,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:43,952 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1515700702, now seen corresponding path program 5 times [2019-12-27 00:23:43,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:43,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782868899] [2019-12-27 00:23:43,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:44,291 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 00:23:44,432 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-27 00:23:44,708 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-12-27 00:23:44,868 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-12-27 00:23:44,997 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-12-27 00:23:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:45,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782868899] [2019-12-27 00:23:45,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:45,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:45,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887639959] [2019-12-27 00:23:45,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:45,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:45,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:45,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:45,562 INFO L87 Difference]: Start difference. First operand 321 states and 673 transitions. Second operand 16 states. [2019-12-27 00:23:46,054 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-27 00:23:46,383 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 00:23:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:47,517 INFO L93 Difference]: Finished difference Result 445 states and 911 transitions. [2019-12-27 00:23:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:23:47,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:47,521 INFO L225 Difference]: With dead ends: 445 [2019-12-27 00:23:47,521 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 00:23:47,522 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-27 00:23:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 00:23:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 319. [2019-12-27 00:23:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 00:23:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 668 transitions. [2019-12-27 00:23:47,530 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 668 transitions. Word has length 22 [2019-12-27 00:23:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:47,530 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 668 transitions. [2019-12-27 00:23:47,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 668 transitions. [2019-12-27 00:23:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:47,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:47,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:47,532 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069572, now seen corresponding path program 6 times [2019-12-27 00:23:47,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:47,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103892189] [2019-12-27 00:23:47,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:48,230 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2019-12-27 00:23:48,360 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-12-27 00:23:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:48,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103892189] [2019-12-27 00:23:48,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:48,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:48,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871450255] [2019-12-27 00:23:48,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:48,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:48,921 INFO L87 Difference]: Start difference. First operand 319 states and 668 transitions. Second operand 16 states. [2019-12-27 00:23:49,391 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:23:49,708 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:23:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:50,916 INFO L93 Difference]: Finished difference Result 443 states and 903 transitions. [2019-12-27 00:23:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:23:50,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:50,919 INFO L225 Difference]: With dead ends: 443 [2019-12-27 00:23:50,920 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 00:23:50,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:23:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 00:23:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 327. [2019-12-27 00:23:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 00:23:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 674 transitions. [2019-12-27 00:23:50,929 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 674 transitions. Word has length 22 [2019-12-27 00:23:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:50,929 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 674 transitions. [2019-12-27 00:23:50,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 674 transitions. [2019-12-27 00:23:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:50,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:50,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:50,931 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash 718214449, now seen corresponding path program 3 times [2019-12-27 00:23:50,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:50,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593870880] [2019-12-27 00:23:50,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:51,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593870880] [2019-12-27 00:23:51,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:51,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:51,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659736124] [2019-12-27 00:23:51,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:51,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:51,376 INFO L87 Difference]: Start difference. First operand 327 states and 674 transitions. Second operand 9 states. [2019-12-27 00:23:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:51,912 INFO L93 Difference]: Finished difference Result 405 states and 792 transitions. [2019-12-27 00:23:51,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:23:51,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 00:23:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:51,915 INFO L225 Difference]: With dead ends: 405 [2019-12-27 00:23:51,915 INFO L226 Difference]: Without dead ends: 393 [2019-12-27 00:23:51,916 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-27 00:23:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-27 00:23:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 309. [2019-12-27 00:23:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 00:23:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 649 transitions. [2019-12-27 00:23:51,923 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 649 transitions. Word has length 22 [2019-12-27 00:23:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:51,924 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 649 transitions. [2019-12-27 00:23:51,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 649 transitions. [2019-12-27 00:23:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:51,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:51,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-27 00:23:51,925 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:51,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:51,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1341843718, now seen corresponding path program 7 times [2019-12-27 00:23:51,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:51,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143903313] [2019-12-27 00:23:51,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:52,233 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-27 00:23:52,375 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-27 00:23:52,508 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-27 00:23:52,782 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-12-27 00:23:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:53,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143903313] [2019-12-27 00:23:53,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:53,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:53,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826210533] [2019-12-27 00:23:53,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:53,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:53,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:53,347 INFO L87 Difference]: Start difference. First operand 309 states and 649 transitions. Second operand 16 states. [2019-12-27 00:23:53,860 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:23:54,165 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:23:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:55,587 INFO L93 Difference]: Finished difference Result 464 states and 936 transitions. [2019-12-27 00:23:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:23:55,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:55,590 INFO L225 Difference]: With dead ends: 464 [2019-12-27 00:23:55,590 INFO L226 Difference]: Without dead ends: 442 [2019-12-27 00:23:55,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-27 00:23:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-27 00:23:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 299. [2019-12-27 00:23:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-27 00:23:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 632 transitions. [2019-12-27 00:23:55,599 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 632 transitions. Word has length 22 [2019-12-27 00:23:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:55,599 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 632 transitions. [2019-12-27 00:23:55,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 632 transitions. [2019-12-27 00:23:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:55,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:55,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:55,600 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1650245952, now seen corresponding path program 8 times [2019-12-27 00:23:55,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:55,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140464288] [2019-12-27 00:23:55,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:55,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140464288] [2019-12-27 00:23:55,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:55,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:23:55,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231230970] [2019-12-27 00:23:55,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:23:55,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:23:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:23:55,835 INFO L87 Difference]: Start difference. First operand 299 states and 632 transitions. Second operand 6 states. [2019-12-27 00:23:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:56,015 INFO L93 Difference]: Finished difference Result 315 states and 656 transitions. [2019-12-27 00:23:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:23:56,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:23:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:56,018 INFO L225 Difference]: With dead ends: 315 [2019-12-27 00:23:56,018 INFO L226 Difference]: Without dead ends: 315 [2019-12-27 00:23:56,018 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-27 00:23:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-27 00:23:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-12-27 00:23:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-27 00:23:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 652 transitions. [2019-12-27 00:23:56,025 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 652 transitions. Word has length 22 [2019-12-27 00:23:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:56,025 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 652 transitions. [2019-12-27 00:23:56,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:23:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 652 transitions. [2019-12-27 00:23:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:56,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:56,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:56,027 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash -936962176, now seen corresponding path program 9 times [2019-12-27 00:23:56,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:56,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100708403] [2019-12-27 00:23:56,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:56,504 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-27 00:23:56,729 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-27 00:23:56,870 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-12-27 00:23:57,105 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-27 00:23:57,272 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-27 00:23:57,458 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-27 00:23:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:23:58,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100708403] [2019-12-27 00:23:58,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:58,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:23:58,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905989114] [2019-12-27 00:23:58,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:23:58,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:58,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:23:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:23:58,061 INFO L87 Difference]: Start difference. First operand 311 states and 652 transitions. Second operand 16 states. [2019-12-27 00:23:58,520 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:23:58,842 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:23:59,146 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 00:23:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:59,866 INFO L93 Difference]: Finished difference Result 340 states and 695 transitions. [2019-12-27 00:23:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:23:59,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:23:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:59,869 INFO L225 Difference]: With dead ends: 340 [2019-12-27 00:23:59,869 INFO L226 Difference]: Without dead ends: 340 [2019-12-27 00:23:59,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:23:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-27 00:23:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-12-27 00:23:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-27 00:23:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 695 transitions. [2019-12-27 00:23:59,877 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 695 transitions. Word has length 22 [2019-12-27 00:23:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:59,877 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 695 transitions. [2019-12-27 00:23:59,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:23:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 695 transitions. [2019-12-27 00:23:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:23:59,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:59,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:59,879 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -936962191, now seen corresponding path program 4 times [2019-12-27 00:23:59,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:59,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900136011] [2019-12-27 00:23:59,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:00,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900136011] [2019-12-27 00:24:00,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:00,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:24:00,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44213504] [2019-12-27 00:24:00,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:24:00,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:24:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:24:00,576 INFO L87 Difference]: Start difference. First operand 339 states and 695 transitions. Second operand 12 states. [2019-12-27 00:24:01,339 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-27 00:24:01,659 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-12-27 00:24:01,794 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-27 00:24:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:02,211 INFO L93 Difference]: Finished difference Result 535 states and 1007 transitions. [2019-12-27 00:24:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:24:02,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-27 00:24:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:02,213 INFO L225 Difference]: With dead ends: 535 [2019-12-27 00:24:02,213 INFO L226 Difference]: Without dead ends: 507 [2019-12-27 00:24:02,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:24:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-27 00:24:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 337. [2019-12-27 00:24:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-27 00:24:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 700 transitions. [2019-12-27 00:24:02,223 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 700 transitions. Word has length 22 [2019-12-27 00:24:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:02,223 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 700 transitions. [2019-12-27 00:24:02,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:24:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 700 transitions. [2019-12-27 00:24:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:02,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:02,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:02,224 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:24:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash 590296588, now seen corresponding path program 10 times [2019-12-27 00:24:02,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:02,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100308037] [2019-12-27 00:24:02,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:03,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100308037] [2019-12-27 00:24:03,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:03,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:03,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811827251] [2019-12-27 00:24:03,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:03,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:03,657 INFO L87 Difference]: Start difference. First operand 337 states and 700 transitions. Second operand 16 states. [2019-12-27 00:24:04,125 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:24:04,432 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:24:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:05,457 INFO L93 Difference]: Finished difference Result 380 states and 773 transitions. [2019-12-27 00:24:05,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:24:05,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:05,460 INFO L225 Difference]: With dead ends: 380 [2019-12-27 00:24:05,460 INFO L226 Difference]: Without dead ends: 380 [2019-12-27 00:24:05,460 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-27 00:24:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-27 00:24:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 365. [2019-12-27 00:24:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-27 00:24:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 746 transitions. [2019-12-27 00:24:05,468 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 746 transitions. Word has length 22 [2019-12-27 00:24:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:05,468 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 746 transitions. [2019-12-27 00:24:05,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 746 transitions. [2019-12-27 00:24:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:05,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:05,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:05,470 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-27 00:24:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 590296573, now seen corresponding path program 5 times [2019-12-27 00:24:05,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:05,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681259647] [2019-12-27 00:24:05,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:06,262 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-12-27 00:24:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:06,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681259647] [2019-12-27 00:24:06,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:06,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:24:06,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209798769] [2019-12-27 00:24:06,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:24:06,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:24:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:24:06,504 INFO L87 Difference]: Start difference. First operand 365 states and 746 transitions. Second operand 12 states. [2019-12-27 00:24:06,902 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-27 00:24:07,917 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-27 00:24:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:08,143 INFO L93 Difference]: Finished difference Result 598 states and 1125 transitions. [2019-12-27 00:24:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:24:08,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-27 00:24:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:08,147 INFO L225 Difference]: With dead ends: 598 [2019-12-27 00:24:08,147 INFO L226 Difference]: Without dead ends: 576 [2019-12-27 00:24:08,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:24:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-27 00:24:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 347. [2019-12-27 00:24:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-27 00:24:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 727 transitions. [2019-12-27 00:24:08,155 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 727 transitions. Word has length 22 [2019-12-27 00:24:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:08,155 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 727 transitions. [2019-12-27 00:24:08,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:24:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 727 transitions. [2019-12-27 00:24:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:08,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:08,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-27 00:24:08,157 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-27 00:24:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1516658228, now seen corresponding path program 11 times [2019-12-27 00:24:08,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:08,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738969910] [2019-12-27 00:24:08,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:08,449 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 00:24:08,581 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-27 00:24:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:09,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738969910] [2019-12-27 00:24:09,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:09,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:09,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588017708] [2019-12-27 00:24:09,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:09,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:09,618 INFO L87 Difference]: Start difference. First operand 347 states and 727 transitions. Second operand 16 states. [2019-12-27 00:24:10,071 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:24:10,368 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:24:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:11,434 INFO L93 Difference]: Finished difference Result 388 states and 790 transitions. [2019-12-27 00:24:11,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:24:11,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:11,437 INFO L225 Difference]: With dead ends: 388 [2019-12-27 00:24:11,437 INFO L226 Difference]: Without dead ends: 374 [2019-12-27 00:24:11,437 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-27 00:24:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-27 00:24:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 351. [2019-12-27 00:24:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-27 00:24:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 733 transitions. [2019-12-27 00:24:11,444 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 733 transitions. Word has length 22 [2019-12-27 00:24:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:11,444 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 733 transitions. [2019-12-27 00:24:11,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 733 transitions. [2019-12-27 00:24:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:11,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:11,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:11,445 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-27 00:24:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:11,446 INFO L82 PathProgramCache]: Analyzing trace with hash -835410036, now seen corresponding path program 12 times [2019-12-27 00:24:11,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:11,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667064170] [2019-12-27 00:24:11,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:12,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667064170] [2019-12-27 00:24:12,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:12,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:12,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827557374] [2019-12-27 00:24:12,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:12,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:12,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:12,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:12,698 INFO L87 Difference]: Start difference. First operand 351 states and 733 transitions. Second operand 16 states. [2019-12-27 00:24:13,009 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-27 00:24:13,198 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-27 00:24:13,496 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 00:24:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:14,413 INFO L93 Difference]: Finished difference Result 380 states and 774 transitions. [2019-12-27 00:24:14,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:24:14,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:14,416 INFO L225 Difference]: With dead ends: 380 [2019-12-27 00:24:14,416 INFO L226 Difference]: Without dead ends: 364 [2019-12-27 00:24:14,417 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-27 00:24:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-12-27 00:24:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 343. [2019-12-27 00:24:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 00:24:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 719 transitions. [2019-12-27 00:24:14,423 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 719 transitions. Word has length 22 [2019-12-27 00:24:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:14,423 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 719 transitions. [2019-12-27 00:24:14,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 719 transitions. [2019-12-27 00:24:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:14,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:14,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:14,425 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-27 00:24:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:14,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1201713386, now seen corresponding path program 13 times [2019-12-27 00:24:14,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:14,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153733678] [2019-12-27 00:24:14,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:15,157 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-27 00:24:15,299 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-12-27 00:24:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:15,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153733678] [2019-12-27 00:24:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:15,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68324554] [2019-12-27 00:24:15,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:15,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:15,973 INFO L87 Difference]: Start difference. First operand 343 states and 719 transitions. Second operand 16 states. [2019-12-27 00:24:16,460 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:24:16,756 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 00:24:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:17,688 INFO L93 Difference]: Finished difference Result 378 states and 776 transitions. [2019-12-27 00:24:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:17,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:17,691 INFO L225 Difference]: With dead ends: 378 [2019-12-27 00:24:17,691 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 00:24:17,692 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-27 00:24:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 00:24:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2019-12-27 00:24:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-27 00:24:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 708 transitions. [2019-12-27 00:24:17,699 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 708 transitions. Word has length 22 [2019-12-27 00:24:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:17,699 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 708 transitions. [2019-12-27 00:24:17,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 708 transitions. [2019-12-27 00:24:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:17,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:17,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:17,702 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-27 00:24:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash 563733022, now seen corresponding path program 14 times [2019-12-27 00:24:17,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:17,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563866281] [2019-12-27 00:24:17,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:18,292 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-12-27 00:24:18,548 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2019-12-27 00:24:18,681 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 27 [2019-12-27 00:24:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:19,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563866281] [2019-12-27 00:24:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:19,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:19,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839258454] [2019-12-27 00:24:19,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:19,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:19,313 INFO L87 Difference]: Start difference. First operand 337 states and 708 transitions. Second operand 16 states. [2019-12-27 00:24:19,779 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-27 00:24:20,097 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-27 00:24:20,347 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-27 00:24:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:21,042 INFO L93 Difference]: Finished difference Result 367 states and 752 transitions. [2019-12-27 00:24:21,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:21,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:21,044 INFO L225 Difference]: With dead ends: 367 [2019-12-27 00:24:21,044 INFO L226 Difference]: Without dead ends: 333 [2019-12-27 00:24:21,045 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-27 00:24:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-27 00:24:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-12-27 00:24:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-27 00:24:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 700 transitions. [2019-12-27 00:24:21,051 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 700 transitions. Word has length 22 [2019-12-27 00:24:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:21,051 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 700 transitions. [2019-12-27 00:24:21,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 700 transitions. [2019-12-27 00:24:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:21,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:21,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:21,053 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-27 00:24:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash -778198608, now seen corresponding path program 15 times [2019-12-27 00:24:21,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:21,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789230552] [2019-12-27 00:24:21,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:22,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789230552] [2019-12-27 00:24:22,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:22,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:22,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392640964] [2019-12-27 00:24:22,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:22,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:22,325 INFO L87 Difference]: Start difference. First operand 333 states and 700 transitions. Second operand 16 states. [2019-12-27 00:24:23,111 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 00:24:23,435 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 00:24:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:24,449 INFO L93 Difference]: Finished difference Result 385 states and 778 transitions. [2019-12-27 00:24:24,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:24:24,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:24,451 INFO L225 Difference]: With dead ends: 385 [2019-12-27 00:24:24,451 INFO L226 Difference]: Without dead ends: 370 [2019-12-27 00:24:24,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:24:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-27 00:24:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 328. [2019-12-27 00:24:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 00:24:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 694 transitions. [2019-12-27 00:24:24,458 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 694 transitions. Word has length 22 [2019-12-27 00:24:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:24,458 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 694 transitions. [2019-12-27 00:24:24,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 694 transitions. [2019-12-27 00:24:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:24,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:24,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:24,460 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-27 00:24:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2127826590, now seen corresponding path program 16 times [2019-12-27 00:24:24,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:24,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030243295] [2019-12-27 00:24:24,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:25,091 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2019-12-27 00:24:25,254 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2019-12-27 00:24:25,395 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-12-27 00:24:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:25,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030243295] [2019-12-27 00:24:25,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:25,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:25,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825279955] [2019-12-27 00:24:25,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:25,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:25,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:25,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:25,980 INFO L87 Difference]: Start difference. First operand 328 states and 694 transitions. Second operand 16 states. [2019-12-27 00:24:26,671 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-27 00:24:26,949 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-27 00:24:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:27,649 INFO L93 Difference]: Finished difference Result 354 states and 734 transitions. [2019-12-27 00:24:27,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:27,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:27,651 INFO L225 Difference]: With dead ends: 354 [2019-12-27 00:24:27,651 INFO L226 Difference]: Without dead ends: 321 [2019-12-27 00:24:27,652 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-27 00:24:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-27 00:24:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-12-27 00:24:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 00:24:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 686 transitions. [2019-12-27 00:24:27,657 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 686 transitions. Word has length 22 [2019-12-27 00:24:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:27,658 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 686 transitions. [2019-12-27 00:24:27,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 686 transitions. [2019-12-27 00:24:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:27,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:27,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:27,659 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-27 00:24:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1866831716, now seen corresponding path program 17 times [2019-12-27 00:24:27,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:27,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579900011] [2019-12-27 00:24:27,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:27,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579900011] [2019-12-27 00:24:27,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:27,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:24:27,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178529061] [2019-12-27 00:24:27,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:24:27,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:24:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:24:27,893 INFO L87 Difference]: Start difference. First operand 321 states and 686 transitions. Second operand 6 states. [2019-12-27 00:24:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:28,048 INFO L93 Difference]: Finished difference Result 102 states and 171 transitions. [2019-12-27 00:24:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:24:28,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:24:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:28,050 INFO L225 Difference]: With dead ends: 102 [2019-12-27 00:24:28,050 INFO L226 Difference]: Without dead ends: 102 [2019-12-27 00:24:28,051 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-27 00:24:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-27 00:24:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-27 00:24:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-27 00:24:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 171 transitions. [2019-12-27 00:24:28,054 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 171 transitions. Word has length 22 [2019-12-27 00:24:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:28,054 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 171 transitions. [2019-12-27 00:24:28,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:24:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 171 transitions. [2019-12-27 00:24:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:28,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:28,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:28,055 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-27 00:24:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash -720376412, now seen corresponding path program 18 times [2019-12-27 00:24:28,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:28,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625342178] [2019-12-27 00:24:28,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:28,811 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-27 00:24:28,951 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-27 00:24:29,088 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-27 00:24:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:29,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625342178] [2019-12-27 00:24:29,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:29,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:29,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216725641] [2019-12-27 00:24:29,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:29,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:29,648 INFO L87 Difference]: Start difference. First operand 102 states and 171 transitions. Second operand 16 states. [2019-12-27 00:24:30,097 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 00:24:30,328 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 00:24:30,561 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-27 00:24:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:31,287 INFO L93 Difference]: Finished difference Result 147 states and 240 transitions. [2019-12-27 00:24:31,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:31,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:31,289 INFO L225 Difference]: With dead ends: 147 [2019-12-27 00:24:31,289 INFO L226 Difference]: Without dead ends: 108 [2019-12-27 00:24:31,289 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-27 00:24:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-27 00:24:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-12-27 00:24:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-27 00:24:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2019-12-27 00:24:31,299 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 22 [2019-12-27 00:24:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:31,300 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2019-12-27 00:24:31,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2019-12-27 00:24:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:31,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:31,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:31,301 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-27 00:24:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 806882352, now seen corresponding path program 19 times [2019-12-27 00:24:31,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:31,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223353603] [2019-12-27 00:24:31,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:31,991 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-27 00:24:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:32,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223353603] [2019-12-27 00:24:32,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:32,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:32,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978115767] [2019-12-27 00:24:32,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:32,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:32,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:32,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:32,769 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 16 states. [2019-12-27 00:24:33,231 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-27 00:24:33,463 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-27 00:24:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:34,390 INFO L93 Difference]: Finished difference Result 177 states and 300 transitions. [2019-12-27 00:24:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:34,390 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:34,391 INFO L225 Difference]: With dead ends: 177 [2019-12-27 00:24:34,391 INFO L226 Difference]: Without dead ends: 147 [2019-12-27 00:24:34,392 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-27 00:24:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-27 00:24:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2019-12-27 00:24:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-27 00:24:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 205 transitions. [2019-12-27 00:24:34,395 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 205 transitions. Word has length 22 [2019-12-27 00:24:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:34,395 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 205 transitions. [2019-12-27 00:24:34,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 205 transitions. [2019-12-27 00:24:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:34,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:34,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:34,396 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-27 00:24:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1300072464, now seen corresponding path program 20 times [2019-12-27 00:24:34,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:34,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416919525] [2019-12-27 00:24:34,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:34,715 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 00:24:35,152 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-27 00:24:35,281 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-27 00:24:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:35,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416919525] [2019-12-27 00:24:35,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:35,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:35,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137936810] [2019-12-27 00:24:35,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:35,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:35,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:35,890 INFO L87 Difference]: Start difference. First operand 122 states and 205 transitions. Second operand 16 states. [2019-12-27 00:24:36,334 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 00:24:36,562 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 00:24:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:37,543 INFO L93 Difference]: Finished difference Result 186 states and 304 transitions. [2019-12-27 00:24:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:24:37,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:37,544 INFO L225 Difference]: With dead ends: 186 [2019-12-27 00:24:37,544 INFO L226 Difference]: Without dead ends: 166 [2019-12-27 00:24:37,545 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-27 00:24:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-27 00:24:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2019-12-27 00:24:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-27 00:24:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 217 transitions. [2019-12-27 00:24:37,547 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 217 transitions. Word has length 22 [2019-12-27 00:24:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:37,547 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 217 transitions. [2019-12-27 00:24:37,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 217 transitions. [2019-12-27 00:24:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:37,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:37,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:37,548 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-27 00:24:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -618824272, now seen corresponding path program 21 times [2019-12-27 00:24:37,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:37,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405532720] [2019-12-27 00:24:37,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:37,971 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-12-27 00:24:38,222 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-27 00:24:38,348 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-27 00:24:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:38,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405532720] [2019-12-27 00:24:38,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:38,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:38,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94331575] [2019-12-27 00:24:38,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:38,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:38,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:38,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:38,887 INFO L87 Difference]: Start difference. First operand 130 states and 217 transitions. Second operand 16 states. [2019-12-27 00:24:39,335 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-27 00:24:39,566 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-27 00:24:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:40,429 INFO L93 Difference]: Finished difference Result 176 states and 282 transitions. [2019-12-27 00:24:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:24:40,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:40,431 INFO L225 Difference]: With dead ends: 176 [2019-12-27 00:24:40,431 INFO L226 Difference]: Without dead ends: 146 [2019-12-27 00:24:40,431 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-27 00:24:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-27 00:24:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2019-12-27 00:24:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-27 00:24:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 189 transitions. [2019-12-27 00:24:40,435 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 189 transitions. Word has length 22 [2019-12-27 00:24:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:40,435 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 189 transitions. [2019-12-27 00:24:40,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 189 transitions. [2019-12-27 00:24:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:40,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:40,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:40,436 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-27 00:24:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -985127622, now seen corresponding path program 22 times [2019-12-27 00:24:40,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:40,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576500960] [2019-12-27 00:24:40,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:40,883 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2019-12-27 00:24:41,163 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-27 00:24:41,301 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-12-27 00:24:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:41,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576500960] [2019-12-27 00:24:41,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:41,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:41,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222649763] [2019-12-27 00:24:41,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:41,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:41,929 INFO L87 Difference]: Start difference. First operand 114 states and 189 transitions. Second operand 16 states. [2019-12-27 00:24:42,369 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 00:24:42,596 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 00:24:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:43,531 INFO L93 Difference]: Finished difference Result 167 states and 274 transitions. [2019-12-27 00:24:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:43,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:43,532 INFO L225 Difference]: With dead ends: 167 [2019-12-27 00:24:43,532 INFO L226 Difference]: Without dead ends: 118 [2019-12-27 00:24:43,533 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-27 00:24:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-27 00:24:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-12-27 00:24:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-27 00:24:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 167 transitions. [2019-12-27 00:24:43,535 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 167 transitions. Word has length 22 [2019-12-27 00:24:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:43,535 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 167 transitions. [2019-12-27 00:24:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 167 transitions. [2019-12-27 00:24:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:43,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:43,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:43,536 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-27 00:24:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:43,536 INFO L82 PathProgramCache]: Analyzing trace with hash 780318786, now seen corresponding path program 23 times [2019-12-27 00:24:43,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:43,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410573347] [2019-12-27 00:24:43,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:44,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410573347] [2019-12-27 00:24:44,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:44,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:44,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699813422] [2019-12-27 00:24:44,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:44,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:44,999 INFO L87 Difference]: Start difference. First operand 102 states and 167 transitions. Second operand 16 states. [2019-12-27 00:24:45,470 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 00:24:45,704 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-27 00:24:45,949 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-27 00:24:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:46,719 INFO L93 Difference]: Finished difference Result 141 states and 226 transitions. [2019-12-27 00:24:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:46,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:46,720 INFO L225 Difference]: With dead ends: 141 [2019-12-27 00:24:46,721 INFO L226 Difference]: Without dead ends: 91 [2019-12-27 00:24:46,721 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-27 00:24:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-27 00:24:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-27 00:24:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-27 00:24:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 148 transitions. [2019-12-27 00:24:46,724 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 148 transitions. Word has length 22 [2019-12-27 00:24:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:46,724 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 148 transitions. [2019-12-27 00:24:46,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 148 transitions. [2019-12-27 00:24:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:46,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:46,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:46,725 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-27 00:24:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash 799080048, now seen corresponding path program 24 times [2019-12-27 00:24:46,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:46,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564138232] [2019-12-27 00:24:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:47,209 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2019-12-27 00:24:47,373 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-12-27 00:24:47,520 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-27 00:24:47,667 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-27 00:24:47,822 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-27 00:24:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:48,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564138232] [2019-12-27 00:24:48,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:48,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:48,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007624200] [2019-12-27 00:24:48,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:48,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:48,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:48,398 INFO L87 Difference]: Start difference. First operand 91 states and 148 transitions. Second operand 16 states. [2019-12-27 00:24:49,052 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 00:24:49,278 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-27 00:24:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:49,978 INFO L93 Difference]: Finished difference Result 128 states and 205 transitions. [2019-12-27 00:24:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:49,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:49,979 INFO L225 Difference]: With dead ends: 128 [2019-12-27 00:24:49,979 INFO L226 Difference]: Without dead ends: 89 [2019-12-27 00:24:49,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:24:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-27 00:24:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-27 00:24:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-27 00:24:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 144 transitions. [2019-12-27 00:24:49,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 144 transitions. Word has length 22 [2019-12-27 00:24:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:49,982 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 144 transitions. [2019-12-27 00:24:49,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 144 transitions. [2019-12-27 00:24:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:49,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:49,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:49,983 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-27 00:24:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1968628484, now seen corresponding path program 25 times [2019-12-27 00:24:49,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:49,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458899903] [2019-12-27 00:24:49,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:50,561 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-27 00:24:50,703 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2019-12-27 00:24:50,829 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-27 00:24:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:51,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458899903] [2019-12-27 00:24:51,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:51,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:51,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751705701] [2019-12-27 00:24:51,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:51,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:51,458 INFO L87 Difference]: Start difference. First operand 89 states and 144 transitions. Second operand 16 states. [2019-12-27 00:24:52,118 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 00:24:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:53,054 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2019-12-27 00:24:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:53,054 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:53,055 INFO L225 Difference]: With dead ends: 158 [2019-12-27 00:24:53,056 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 00:24:53,056 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-27 00:24:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 00:24:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2019-12-27 00:24:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-27 00:24:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 172 transitions. [2019-12-27 00:24:53,059 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 172 transitions. Word has length 22 [2019-12-27 00:24:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:53,059 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 172 transitions. [2019-12-27 00:24:53,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 172 transitions. [2019-12-27 00:24:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:53,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:53,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:53,062 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-27 00:24:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 219383996, now seen corresponding path program 26 times [2019-12-27 00:24:53,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:53,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814100508] [2019-12-27 00:24:53,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:53,334 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 00:24:53,700 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-27 00:24:53,835 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-12-27 00:24:53,964 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-27 00:24:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:54,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814100508] [2019-12-27 00:24:54,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:54,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:54,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068103783] [2019-12-27 00:24:54,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:54,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:54,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:54,590 INFO L87 Difference]: Start difference. First operand 105 states and 172 transitions. Second operand 16 states. [2019-12-27 00:24:55,225 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 00:24:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:56,212 INFO L93 Difference]: Finished difference Result 167 states and 269 transitions. [2019-12-27 00:24:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:24:56,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:56,213 INFO L225 Difference]: With dead ends: 167 [2019-12-27 00:24:56,213 INFO L226 Difference]: Without dead ends: 147 [2019-12-27 00:24:56,214 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-27 00:24:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-27 00:24:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2019-12-27 00:24:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-27 00:24:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 184 transitions. [2019-12-27 00:24:56,217 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 184 transitions. Word has length 22 [2019-12-27 00:24:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 184 transitions. [2019-12-27 00:24:56,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 184 transitions. [2019-12-27 00:24:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:56,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:56,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:56,218 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-27 00:24:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 900632188, now seen corresponding path program 27 times [2019-12-27 00:24:56,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:56,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091952357] [2019-12-27 00:24:56,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:56,780 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-27 00:24:56,917 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-27 00:24:57,048 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-27 00:24:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:24:57,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091952357] [2019-12-27 00:24:57,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:57,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:24:57,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373613711] [2019-12-27 00:24:57,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:24:57,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:24:57,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:24:57,613 INFO L87 Difference]: Start difference. First operand 113 states and 184 transitions. Second operand 16 states. [2019-12-27 00:24:58,273 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-27 00:24:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:59,089 INFO L93 Difference]: Finished difference Result 157 states and 247 transitions. [2019-12-27 00:24:59,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:24:59,090 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:24:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:59,091 INFO L225 Difference]: With dead ends: 157 [2019-12-27 00:24:59,091 INFO L226 Difference]: Without dead ends: 127 [2019-12-27 00:24:59,091 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-27 00:24:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-27 00:24:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 97. [2019-12-27 00:24:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-27 00:24:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 156 transitions. [2019-12-27 00:24:59,094 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 156 transitions. Word has length 22 [2019-12-27 00:24:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:59,094 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 156 transitions. [2019-12-27 00:24:59,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:24:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 156 transitions. [2019-12-27 00:24:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:24:59,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:59,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:59,095 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-27 00:24:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash 534328838, now seen corresponding path program 28 times [2019-12-27 00:24:59,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:59,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704807742] [2019-12-27 00:24:59,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:59,658 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-12-27 00:24:59,799 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-12-27 00:24:59,926 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-27 00:25:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:00,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704807742] [2019-12-27 00:25:00,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:00,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:25:00,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400372179] [2019-12-27 00:25:00,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:25:00,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:25:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:00,572 INFO L87 Difference]: Start difference. First operand 97 states and 156 transitions. Second operand 16 states. [2019-12-27 00:25:01,192 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 00:25:01,607 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-12-27 00:25:01,915 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-27 00:25:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:02,180 INFO L93 Difference]: Finished difference Result 134 states and 213 transitions. [2019-12-27 00:25:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:25:02,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:25:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:02,181 INFO L225 Difference]: With dead ends: 134 [2019-12-27 00:25:02,181 INFO L226 Difference]: Without dead ends: 85 [2019-12-27 00:25:02,182 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-27 00:25:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-27 00:25:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-27 00:25:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-27 00:25:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 136 transitions. [2019-12-27 00:25:02,184 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 136 transitions. Word has length 22 [2019-12-27 00:25:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:02,184 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 136 transitions. [2019-12-27 00:25:02,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:25:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2019-12-27 00:25:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:25:02,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:02,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:02,185 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-27 00:25:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1929190334, now seen corresponding path program 29 times [2019-12-27 00:25:02,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:02,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254992271] [2019-12-27 00:25:02,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:02,454 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-27 00:25:02,581 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-27 00:25:02,754 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-12-27 00:25:02,935 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-27 00:25:03,063 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-12-27 00:25:03,189 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-27 00:25:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:03,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254992271] [2019-12-27 00:25:03,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:03,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:25:03,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670761834] [2019-12-27 00:25:03,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:25:03,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:25:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:03,810 INFO L87 Difference]: Start difference. First operand 85 states and 136 transitions. Second operand 16 states. [2019-12-27 00:25:04,775 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-27 00:25:05,039 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 00:25:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:05,339 INFO L93 Difference]: Finished difference Result 120 states and 191 transitions. [2019-12-27 00:25:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:25:05,345 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:25:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:05,346 INFO L225 Difference]: With dead ends: 120 [2019-12-27 00:25:05,346 INFO L226 Difference]: Without dead ends: 90 [2019-12-27 00:25:05,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:25:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-27 00:25:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-12-27 00:25:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-27 00:25:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2019-12-27 00:25:05,348 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 22 [2019-12-27 00:25:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:05,348 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2019-12-27 00:25:05,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:25:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2019-12-27 00:25:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:25:05,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:05,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:05,349 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-27 00:25:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash -177764482, now seen corresponding path program 30 times [2019-12-27 00:25:05,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:05,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496570824] [2019-12-27 00:25:05,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:05,856 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-12-27 00:25:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:06,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496570824] [2019-12-27 00:25:06,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:06,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:25:06,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080097315] [2019-12-27 00:25:06,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:25:06,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:25:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:06,721 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand 16 states. [2019-12-27 00:25:07,693 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 00:25:07,944 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 00:25:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:08,350 INFO L93 Difference]: Finished difference Result 114 states and 172 transitions. [2019-12-27 00:25:08,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:25:08,350 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:25:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:08,351 INFO L225 Difference]: With dead ends: 114 [2019-12-27 00:25:08,351 INFO L226 Difference]: Without dead ends: 94 [2019-12-27 00:25:08,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-27 00:25:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-27 00:25:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-12-27 00:25:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-27 00:25:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2019-12-27 00:25:08,354 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 22 [2019-12-27 00:25:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:08,354 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2019-12-27 00:25:08,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:25:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2019-12-27 00:25:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:25:08,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:08,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:08,355 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-27 00:25:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash 503483710, now seen corresponding path program 31 times [2019-12-27 00:25:08,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:08,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480813443] [2019-12-27 00:25:08,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:08,611 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-27 00:25:09,037 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-27 00:25:09,260 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-12-27 00:25:09,486 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-12-27 00:25:09,801 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-12-27 00:25:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:10,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480813443] [2019-12-27 00:25:10,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:10,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:25:10,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636883856] [2019-12-27 00:25:10,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:25:10,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:25:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:10,275 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand 16 states. [2019-12-27 00:25:11,098 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-27 00:25:11,286 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 00:25:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:11,787 INFO L93 Difference]: Finished difference Result 104 states and 150 transitions. [2019-12-27 00:25:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:25:11,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:25:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:11,788 INFO L225 Difference]: With dead ends: 104 [2019-12-27 00:25:11,788 INFO L226 Difference]: Without dead ends: 74 [2019-12-27 00:25:11,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:25:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-27 00:25:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2019-12-27 00:25:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-27 00:25:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2019-12-27 00:25:11,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 22 [2019-12-27 00:25:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:11,790 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2019-12-27 00:25:11,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:25:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2019-12-27 00:25:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:25:11,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:11,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:11,791 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-27 00:25:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash -3039712, now seen corresponding path program 32 times [2019-12-27 00:25:11,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:11,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92855938] [2019-12-27 00:25:11,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:12,407 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-12-27 00:25:12,534 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-27 00:25:12,670 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-27 00:25:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:13,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92855938] [2019-12-27 00:25:13,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:13,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:25:13,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482608668] [2019-12-27 00:25:13,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:25:13,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:25:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:13,331 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 16 states. [2019-12-27 00:25:14,321 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-12-27 00:25:14,530 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-27 00:25:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:14,735 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2019-12-27 00:25:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:25:14,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 00:25:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:14,736 INFO L225 Difference]: With dead ends: 64 [2019-12-27 00:25:14,736 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 00:25:14,737 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-27 00:25:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 00:25:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 00:25:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 00:25:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 00:25:14,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-27 00:25:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:14,738 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 00:25:14,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:25:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 00:25:14,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 00:25:14,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:25:14 BasicIcfg [2019-12-27 00:25:14,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:25:14,743 INFO L168 Benchmark]: Toolchain (without parser) took 175889.13 ms. Allocated memory was 139.5 MB in the beginning and 302.5 MB in the end (delta: 163.1 MB). Free memory was 100.3 MB in the beginning and 179.2 MB in the end (delta: -78.8 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:14,743 INFO L168 Benchmark]: CDTParser took 1.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:25:14,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1431.36 ms. Allocated memory was 139.5 MB in the beginning and 235.9 MB in the end (delta: 96.5 MB). Free memory was 100.1 MB in the beginning and 166.2 MB in the end (delta: -66.1 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:14,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.43 ms. Allocated memory is still 235.9 MB. Free memory was 166.2 MB in the beginning and 163.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:14,744 INFO L168 Benchmark]: Boogie Preprocessor took 52.55 ms. Allocated memory is still 235.9 MB. Free memory was 163.4 MB in the beginning and 160.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:14,745 INFO L168 Benchmark]: RCFGBuilder took 943.30 ms. Allocated memory is still 235.9 MB. Free memory was 160.6 MB in the beginning and 112.9 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:14,745 INFO L168 Benchmark]: TraceAbstraction took 173384.66 ms. Allocated memory was 235.9 MB in the beginning and 302.5 MB in the end (delta: 66.6 MB). Free memory was 111.5 MB in the beginning and 179.2 MB in the end (delta: -67.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:25:14,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1431.36 ms. Allocated memory was 139.5 MB in the beginning and 235.9 MB in the end (delta: 96.5 MB). Free memory was 100.1 MB in the beginning and 166.2 MB in the end (delta: -66.1 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.43 ms. Allocated memory is still 235.9 MB. Free memory was 166.2 MB in the beginning and 163.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.55 ms. Allocated memory is still 235.9 MB. Free memory was 163.4 MB in the beginning and 160.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 943.30 ms. Allocated memory is still 235.9 MB. Free memory was 160.6 MB in the beginning and 112.9 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 173384.66 ms. Allocated memory was 235.9 MB in the beginning and 302.5 MB in the end (delta: 66.6 MB). Free memory was 111.5 MB in the beginning and 179.2 MB in the end (delta: -67.7 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: 62.2s, 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.4s, 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: 173.2s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 60.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1022 SDtfs, 2344 SDslu, 5132 SDs, 0 SdLazy, 15150 SolverSat, 1056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 871 GetRequests, 28 SyntacticMatches, 92 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 70.6s 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, 1.0s SatisfiabilityAnalysisTime, 48.3s 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...