/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/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:34:22,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:34:22,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:34:22,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:34:22,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:34:22,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:34:22,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:34:22,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:34:22,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:34:22,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:34:22,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:34:22,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:34:22,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:34:22,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:34:22,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:34:22,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:34:22,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:34:22,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:34:22,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:34:22,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:34:22,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:34:22,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:34:22,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:34:22,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:34:22,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:34:22,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:34:22,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:34:22,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:34:22,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:34:22,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:34:22,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:34:22,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:34:22,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:34:22,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:34:22,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:34:22,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:34:22,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:34:22,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:34:22,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:34:22,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:34:22,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:34:22,360 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:34:22,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:34:22,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:34:22,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:34:22,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:34:22,377 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:34:22,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:34:22,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:34:22,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:34:22,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:34:22,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:34:22,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:34:22,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:34:22,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:34:22,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:34:22,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:34:22,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:34:22,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:34:22,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:34:22,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:34:22,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:34:22,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:34:22,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:34:22,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:34:22,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:34:22,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:34:22,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:34:22,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:34:22,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:34:22,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:34:22,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:34:22,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:34:22,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:34:22,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:34:22,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:34:22,701 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:34:22,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 00:34:22,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2959700ab/d30d88b9aebd4ea4b3acca9a98076f5e/FLAG1388de542 [2019-12-27 00:34:23,314 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:34:23,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 00:34:23,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2959700ab/d30d88b9aebd4ea4b3acca9a98076f5e/FLAG1388de542 [2019-12-27 00:34:23,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2959700ab/d30d88b9aebd4ea4b3acca9a98076f5e [2019-12-27 00:34:23,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:34:23,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:34:23,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:34:23,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:34:23,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:34:23,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:34:23" (1/1) ... [2019-12-27 00:34:23,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f8afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:23, skipping insertion in model container [2019-12-27 00:34:23,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:34:23" (1/1) ... [2019-12-27 00:34:23,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:34:23,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:34:23,904 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 00:34:24,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:34:24,338 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:34:24,351 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 00:34:24,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:34:24,584 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:34:24,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24 WrapperNode [2019-12-27 00:34:24,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:34:24,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:34:24,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:34:24,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:34:24,598 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:34:24" (1/1) ... [2019-12-27 00:34:24,632 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:34:24" (1/1) ... [2019-12-27 00:34:24,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:34:24,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:34:24,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:34:24,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:34:24,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (1/1) ... [2019-12-27 00:34:24,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:34:24,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:34:24,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:34:24,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:34:24,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (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:34:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-27 00:34:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-27 00:34:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-27 00:34:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-27 00:34:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:34:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:34:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:34:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:34:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 00:34:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:34:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:34:24,781 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:34:25,427 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:34:25,427 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-27 00:34:25,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:34:25 BoogieIcfgContainer [2019-12-27 00:34:25,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:34:25,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:34:25,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:34:25,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:34:25,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:34:23" (1/3) ... [2019-12-27 00:34:25,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c196d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:34:25, skipping insertion in model container [2019-12-27 00:34:25,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:24" (2/3) ... [2019-12-27 00:34:25,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c196d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:34:25, skipping insertion in model container [2019-12-27 00:34:25,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:34:25" (3/3) ... [2019-12-27 00:34:25,437 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-27 00:34:25,448 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:34:25,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:34:25,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-27 00:34:25,458 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:34:25,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,503 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,503 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,511 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,511 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,511 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,511 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,512 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,512 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,515 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,515 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,517 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,518 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,519 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,519 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,519 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,523 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,523 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,529 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,529 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,530 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,531 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,531 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,532 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,532 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,532 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,532 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,534 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,535 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,536 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,536 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,537 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,537 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,537 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,537 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,537 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,538 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,540 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,540 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,540 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,540 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,540 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,541 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,541 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,541 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,543 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,543 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,543 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,543 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,544 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,544 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,544 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,545 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,545 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,545 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,545 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,545 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,546 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,546 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,546 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,546 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,546 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,546 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,547 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,547 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,547 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,547 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,547 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,548 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,548 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,548 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,548 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,548 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,549 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,549 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,549 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,549 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,549 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,549 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,550 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,550 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,550 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,550 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,550 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,551 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,551 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,551 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,551 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,551 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,552 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,552 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,552 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,552 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,552 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,553 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,553 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,558 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,558 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,558 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,558 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,558 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,559 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,570 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,573 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,574 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,574 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,574 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,574 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,574 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,575 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,575 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,575 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,575 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,575 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,576 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,576 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,576 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,576 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,576 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:25,598 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-27 00:34:25,620 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:34:25,620 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:34:25,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:34:25,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:34:25,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:34:25,621 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:34:25,621 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:34:25,621 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:34:25,638 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-27 00:34:25,640 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 00:34:25,743 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 00:34:25,744 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:34:25,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-27 00:34:25,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 00:34:25,841 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 00:34:25,842 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:34:25,850 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-27 00:34:25,870 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-27 00:34:25,871 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:34:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:26,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:26,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:26,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:28,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:28,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:28,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:28,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:28,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:30,028 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-27 00:34:30,655 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20924 [2019-12-27 00:34:30,656 INFO L214 etLargeBlockEncoding]: Total number of compositions: 153 [2019-12-27 00:34:30,660 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-27 00:34:30,770 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-27 00:34:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-27 00:34:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:34:30,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:30,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:30,807 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash -437483837, now seen corresponding path program 1 times [2019-12-27 00:34:30,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:30,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972342173] [2019-12-27 00:34:30,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:31,276 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:34:31,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972342173] [2019-12-27 00:34:31,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:31,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:34:31,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412892562] [2019-12-27 00:34:31,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:34:31,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:31,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:34:31,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:34:31,302 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-27 00:34:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:31,715 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-27 00:34:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:34:31,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 00:34:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:31,755 INFO L225 Difference]: With dead ends: 2169 [2019-12-27 00:34:31,755 INFO L226 Difference]: Without dead ends: 2053 [2019-12-27 00:34:31,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:34:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-27 00:34:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-27 00:34:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-27 00:34:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-27 00:34:31,942 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-27 00:34:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:31,943 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-27 00:34:31,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:34:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-27 00:34:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:31,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:31,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:31,947 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -357357885, now seen corresponding path program 1 times [2019-12-27 00:34:31,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:31,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812482860] [2019-12-27 00:34:31,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:32,181 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:34:32,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812482860] [2019-12-27 00:34:32,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:32,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:34:32,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675801661] [2019-12-27 00:34:32,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:34:32,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:34:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:34:32,185 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-27 00:34:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:32,822 INFO L93 Difference]: Finished difference Result 2588 states and 8385 transitions. [2019-12-27 00:34:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:34:32,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 00:34:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:32,844 INFO L225 Difference]: With dead ends: 2588 [2019-12-27 00:34:32,845 INFO L226 Difference]: Without dead ends: 2544 [2019-12-27 00:34:32,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:34:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-12-27 00:34:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2019-12-27 00:34:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-27 00:34:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-27 00:34:32,948 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-27 00:34:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:32,949 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-27 00:34:32,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:34:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-27 00:34:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:34:32,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:32,954 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, 1, 1, 1] [2019-12-27 00:34:32,955 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash -220223314, now seen corresponding path program 1 times [2019-12-27 00:34:32,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:32,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961534905] [2019-12-27 00:34:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:33,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961534905] [2019-12-27 00:34:33,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:33,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:34:33,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421880641] [2019-12-27 00:34:33,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:34:33,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:33,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:34:33,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:34:33,629 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 14 states. [2019-12-27 00:34:35,133 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-12-27 00:34:35,301 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-27 00:34:35,493 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 00:34:35,737 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-27 00:34:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:35,960 INFO L93 Difference]: Finished difference Result 3164 states and 10236 transitions. [2019-12-27 00:34:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:34:35,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 00:34:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:35,983 INFO L225 Difference]: With dead ends: 3164 [2019-12-27 00:34:35,983 INFO L226 Difference]: Without dead ends: 3164 [2019-12-27 00:34:35,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:34:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-12-27 00:34:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3104. [2019-12-27 00:34:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-12-27 00:34:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 10106 transitions. [2019-12-27 00:34:36,077 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 10106 transitions. Word has length 25 [2019-12-27 00:34:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:36,078 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 10106 transitions. [2019-12-27 00:34:36,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:34:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 10106 transitions. [2019-12-27 00:34:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:34:36,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:36,086 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, 1, 1, 1] [2019-12-27 00:34:36,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:36,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:36,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1041383458, now seen corresponding path program 1 times [2019-12-27 00:34:36,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:36,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521783667] [2019-12-27 00:34:36,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:36,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521783667] [2019-12-27 00:34:36,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:36,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:34:36,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547974092] [2019-12-27 00:34:36,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:34:36,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:36,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:34:36,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:34:36,542 INFO L87 Difference]: Start difference. First operand 3104 states and 10106 transitions. Second operand 12 states. [2019-12-27 00:34:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:38,342 INFO L93 Difference]: Finished difference Result 3654 states and 11776 transitions. [2019-12-27 00:34:38,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:34:38,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 00:34:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:38,367 INFO L225 Difference]: With dead ends: 3654 [2019-12-27 00:34:38,367 INFO L226 Difference]: Without dead ends: 3654 [2019-12-27 00:34:38,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:34:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-27 00:34:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-27 00:34:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-27 00:34:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-27 00:34:38,468 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-27 00:34:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:38,468 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-27 00:34:38,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:34:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-27 00:34:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:34:38,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:38,477 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, 1, 1, 1] [2019-12-27 00:34:38,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 907099404, now seen corresponding path program 2 times [2019-12-27 00:34:38,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:38,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224449050] [2019-12-27 00:34:38,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:39,058 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:34:39,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224449050] [2019-12-27 00:34:39,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:39,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:34:39,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874468352] [2019-12-27 00:34:39,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:34:39,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:39,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:34:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:34:39,060 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 13 states. [2019-12-27 00:34:41,119 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-12-27 00:34:41,477 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-27 00:34:41,754 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-27 00:34:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:42,066 INFO L93 Difference]: Finished difference Result 5414 states and 17426 transitions. [2019-12-27 00:34:42,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 00:34:42,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 00:34:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:42,102 INFO L225 Difference]: With dead ends: 5414 [2019-12-27 00:34:42,103 INFO L226 Difference]: Without dead ends: 5414 [2019-12-27 00:34:42,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-12-27 00:34:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-12-27 00:34:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 3844. [2019-12-27 00:34:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-27 00:34:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 12546 transitions. [2019-12-27 00:34:42,219 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 12546 transitions. Word has length 25 [2019-12-27 00:34:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:42,220 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 12546 transitions. [2019-12-27 00:34:42,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:34:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 12546 transitions. [2019-12-27 00:34:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:34:42,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:42,230 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, 1, 1, 1] [2019-12-27 00:34:42,230 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 356628326, now seen corresponding path program 3 times [2019-12-27 00:34:42,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:42,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272350197] [2019-12-27 00:34:42,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:42,846 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:34:42,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272350197] [2019-12-27 00:34:42,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:42,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:34:42,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506749337] [2019-12-27 00:34:42,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:34:42,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:42,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:34:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:34:42,848 INFO L87 Difference]: Start difference. First operand 3844 states and 12546 transitions. Second operand 14 states. [2019-12-27 00:34:44,367 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-27 00:34:46,195 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-12-27 00:34:46,348 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-27 00:34:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:46,717 INFO L93 Difference]: Finished difference Result 4818 states and 15403 transitions. [2019-12-27 00:34:46,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 00:34:46,717 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 00:34:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:46,731 INFO L225 Difference]: With dead ends: 4818 [2019-12-27 00:34:46,732 INFO L226 Difference]: Without dead ends: 4818 [2019-12-27 00:34:46,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 00:34:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2019-12-27 00:34:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3188. [2019-12-27 00:34:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-27 00:34:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-27 00:34:46,827 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-27 00:34:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:46,827 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-27 00:34:46,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:34:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-27 00:34:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:34:46,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:46,833 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, 1, 1, 1] [2019-12-27 00:34:46,833 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1491389276, now seen corresponding path program 2 times [2019-12-27 00:34:46,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:46,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817113649] [2019-12-27 00:34:46,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:47,263 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:34:47,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817113649] [2019-12-27 00:34:47,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:47,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:34:47,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373090695] [2019-12-27 00:34:47,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:34:47,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:47,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:34:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:34:47,266 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 13 states. [2019-12-27 00:34:49,891 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-27 00:34:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:50,191 INFO L93 Difference]: Finished difference Result 4168 states and 13116 transitions. [2019-12-27 00:34:50,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 00:34:50,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 00:34:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:50,206 INFO L225 Difference]: With dead ends: 4168 [2019-12-27 00:34:50,207 INFO L226 Difference]: Without dead ends: 4168 [2019-12-27 00:34:50,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2019-12-27 00:34:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-12-27 00:34:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 3188. [2019-12-27 00:34:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-27 00:34:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10166 transitions. [2019-12-27 00:34:50,297 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10166 transitions. Word has length 25 [2019-12-27 00:34:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:50,297 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10166 transitions. [2019-12-27 00:34:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:34:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10166 transitions. [2019-12-27 00:34:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:34:50,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:50,305 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, 1, 1, 1] [2019-12-27 00:34:50,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:50,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1997301412, now seen corresponding path program 3 times [2019-12-27 00:34:50,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:50,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211741608] [2019-12-27 00:34:50,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:50,747 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:34:50,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211741608] [2019-12-27 00:34:50,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:50,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:34:50,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536252304] [2019-12-27 00:34:50,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:34:50,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:34:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:34:50,749 INFO L87 Difference]: Start difference. First operand 3188 states and 10166 transitions. Second operand 12 states. [2019-12-27 00:34:51,747 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-12-27 00:34:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:53,143 INFO L93 Difference]: Finished difference Result 3972 states and 12550 transitions. [2019-12-27 00:34:53,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:34:53,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 00:34:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:53,151 INFO L225 Difference]: With dead ends: 3972 [2019-12-27 00:34:53,151 INFO L226 Difference]: Without dead ends: 3972 [2019-12-27 00:34:53,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:34:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2019-12-27 00:34:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2852. [2019-12-27 00:34:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-27 00:34:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-27 00:34:53,236 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-27 00:34:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:53,237 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-27 00:34:53,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:34:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-27 00:34:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:34:53,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:53,243 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, 1, 1, 1, 1, 1] [2019-12-27 00:34:53,243 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512480, now seen corresponding path program 1 times [2019-12-27 00:34:53,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:53,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441594219] [2019-12-27 00:34:53,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:53,736 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32 [2019-12-27 00:34:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:53,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441594219] [2019-12-27 00:34:53,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:53,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:34:53,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237608575] [2019-12-27 00:34:53,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:34:53,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:34:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:34:53,964 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 16 states. [2019-12-27 00:34:54,635 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-12-27 00:34:55,225 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-27 00:34:55,514 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 00:34:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:56,917 INFO L93 Difference]: Finished difference Result 5017 states and 16132 transitions. [2019-12-27 00:34:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:34:56,918 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:34:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:56,927 INFO L225 Difference]: With dead ends: 5017 [2019-12-27 00:34:56,928 INFO L226 Difference]: Without dead ends: 5017 [2019-12-27 00:34:56,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:34:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-12-27 00:34:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2019-12-27 00:34:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-27 00:34:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13063 transitions. [2019-12-27 00:34:57,034 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13063 transitions. Word has length 27 [2019-12-27 00:34:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:57,035 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13063 transitions. [2019-12-27 00:34:57,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:34:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13063 transitions. [2019-12-27 00:34:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:34:57,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:57,042 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, 1, 1, 1, 1, 1] [2019-12-27 00:34:57,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:34:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash 363501539, now seen corresponding path program 1 times [2019-12-27 00:34:57,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:57,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966828789] [2019-12-27 00:34:57,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:57,738 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:34:57,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966828789] [2019-12-27 00:34:57,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:57,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:34:57,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867086806] [2019-12-27 00:34:57,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:34:57,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:57,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:34:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:34:57,741 INFO L87 Difference]: Start difference. First operand 4102 states and 13063 transitions. Second operand 15 states. [2019-12-27 00:35:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:00,121 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-27 00:35:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:35:00,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:00,131 INFO L225 Difference]: With dead ends: 6137 [2019-12-27 00:35:00,131 INFO L226 Difference]: Without dead ends: 6137 [2019-12-27 00:35:00,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:35:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-27 00:35:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-27 00:35:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-27 00:35:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-27 00:35:00,243 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-27 00:35:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:00,244 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-27 00:35:00,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-27 00:35:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:00,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:00,252 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:00,252 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139074, now seen corresponding path program 2 times [2019-12-27 00:35:00,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:00,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408292494] [2019-12-27 00:35:00,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:00,936 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:35:00,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408292494] [2019-12-27 00:35:00,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:00,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:00,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230767616] [2019-12-27 00:35:00,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:00,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:00,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:00,938 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 16 states. [2019-12-27 00:35:01,507 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-12-27 00:35:02,641 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 00:35:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:04,154 INFO L93 Difference]: Finished difference Result 7329 states and 23441 transitions. [2019-12-27 00:35:04,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:04,155 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:04,167 INFO L225 Difference]: With dead ends: 7329 [2019-12-27 00:35:04,167 INFO L226 Difference]: Without dead ends: 7329 [2019-12-27 00:35:04,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-27 00:35:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 5934. [2019-12-27 00:35:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2019-12-27 00:35:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 18887 transitions. [2019-12-27 00:35:04,269 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 18887 transitions. Word has length 27 [2019-12-27 00:35:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:04,269 INFO L462 AbstractCegarLoop]: Abstraction has 5934 states and 18887 transitions. [2019-12-27 00:35:04,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 18887 transitions. [2019-12-27 00:35:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:04,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:04,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:04,279 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139073, now seen corresponding path program 1 times [2019-12-27 00:35:04,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:04,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442692984] [2019-12-27 00:35:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:04,801 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-12-27 00:35:05,053 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:35:05,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442692984] [2019-12-27 00:35:05,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:05,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:05,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129960992] [2019-12-27 00:35:05,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:05,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:05,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:05,055 INFO L87 Difference]: Start difference. First operand 5934 states and 18887 transitions. Second operand 16 states. [2019-12-27 00:35:06,390 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 00:35:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:08,046 INFO L93 Difference]: Finished difference Result 7329 states and 23321 transitions. [2019-12-27 00:35:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:08,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:08,058 INFO L225 Difference]: With dead ends: 7329 [2019-12-27 00:35:08,058 INFO L226 Difference]: Without dead ends: 7329 [2019-12-27 00:35:08,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-27 00:35:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 4804. [2019-12-27 00:35:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-27 00:35:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-27 00:35:08,183 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-27 00:35:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:08,183 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-27 00:35:08,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-27 00:35:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:08,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:08,194 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:08,194 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227084, now seen corresponding path program 3 times [2019-12-27 00:35:08,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:08,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863274605] [2019-12-27 00:35:08,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:08,791 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-12-27 00:35:09,027 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-27 00:35:09,237 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:35:09,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863274605] [2019-12-27 00:35:09,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:09,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:09,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127279795] [2019-12-27 00:35:09,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:09,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:09,239 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-27 00:35:10,431 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-27 00:35:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:12,247 INFO L93 Difference]: Finished difference Result 6739 states and 21561 transitions. [2019-12-27 00:35:12,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:12,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:12,258 INFO L225 Difference]: With dead ends: 6739 [2019-12-27 00:35:12,258 INFO L226 Difference]: Without dead ends: 6739 [2019-12-27 00:35:12,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2019-12-27 00:35:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 4804. [2019-12-27 00:35:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-27 00:35:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-27 00:35:12,371 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-27 00:35:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:12,371 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-27 00:35:12,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-27 00:35:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:12,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:12,380 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:12,381 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:12,381 INFO L82 PathProgramCache]: Analyzing trace with hash 796249174, now seen corresponding path program 4 times [2019-12-27 00:35:12,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:12,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214684586] [2019-12-27 00:35:12,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:13,025 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:35:13,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214684586] [2019-12-27 00:35:13,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:13,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:35:13,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334334660] [2019-12-27 00:35:13,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:35:13,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:35:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:35:13,026 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 15 states. [2019-12-27 00:35:14,308 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 00:35:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:15,890 INFO L93 Difference]: Finished difference Result 6619 states and 21201 transitions. [2019-12-27 00:35:15,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:35:15,890 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:15,900 INFO L225 Difference]: With dead ends: 6619 [2019-12-27 00:35:15,900 INFO L226 Difference]: Without dead ends: 6619 [2019-12-27 00:35:15,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-27 00:35:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4804. [2019-12-27 00:35:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-27 00:35:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-27 00:35:15,978 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-27 00:35:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:15,978 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-27 00:35:15,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-27 00:35:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:15,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:15,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:15,985 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash 471322490, now seen corresponding path program 5 times [2019-12-27 00:35:15,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:15,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971278213] [2019-12-27 00:35:15,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:16,763 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:35:16,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971278213] [2019-12-27 00:35:16,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:16,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:16,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488351368] [2019-12-27 00:35:16,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:16,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:16,765 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-27 00:35:18,077 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-27 00:35:18,452 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-27 00:35:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:20,366 INFO L93 Difference]: Finished difference Result 8562 states and 27685 transitions. [2019-12-27 00:35:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:35:20,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:20,379 INFO L225 Difference]: With dead ends: 8562 [2019-12-27 00:35:20,379 INFO L226 Difference]: Without dead ends: 8562 [2019-12-27 00:35:20,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-27 00:35:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-12-27 00:35:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 4849. [2019-12-27 00:35:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-27 00:35:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-27 00:35:20,480 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-27 00:35:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:20,480 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-27 00:35:20,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-27 00:35:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:20,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:20,486 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:20,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash -869839874, now seen corresponding path program 6 times [2019-12-27 00:35:20,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:20,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139133348] [2019-12-27 00:35:20,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:21,072 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-27 00:35:21,293 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:35:21,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139133348] [2019-12-27 00:35:21,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:21,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:21,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995747049] [2019-12-27 00:35:21,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:21,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:21,296 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-27 00:35:22,655 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-12-27 00:35:22,934 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-12-27 00:35:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:24,428 INFO L93 Difference]: Finished difference Result 7194 states and 22926 transitions. [2019-12-27 00:35:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:35:24,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:24,439 INFO L225 Difference]: With dead ends: 7194 [2019-12-27 00:35:24,439 INFO L226 Difference]: Without dead ends: 7194 [2019-12-27 00:35:24,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-27 00:35:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-12-27 00:35:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 4849. [2019-12-27 00:35:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-27 00:35:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-27 00:35:24,536 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-27 00:35:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:24,536 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-27 00:35:24,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-27 00:35:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:24,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:24,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:24,542 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360997, now seen corresponding path program 2 times [2019-12-27 00:35:24,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:24,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569865364] [2019-12-27 00:35:24,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:25,193 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:35:25,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569865364] [2019-12-27 00:35:25,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:25,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:25,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062001948] [2019-12-27 00:35:25,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:25,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:25,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:25,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:25,195 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-27 00:35:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:27,906 INFO L93 Difference]: Finished difference Result 7028 states and 22548 transitions. [2019-12-27 00:35:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:27,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:27,916 INFO L225 Difference]: With dead ends: 7028 [2019-12-27 00:35:27,916 INFO L226 Difference]: Without dead ends: 7028 [2019-12-27 00:35:27,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-27 00:35:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 6003. [2019-12-27 00:35:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6003 states. [2019-12-27 00:35:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 19104 transitions. [2019-12-27 00:35:27,995 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 19104 transitions. Word has length 27 [2019-12-27 00:35:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 6003 states and 19104 transitions. [2019-12-27 00:35:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 19104 transitions. [2019-12-27 00:35:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:28,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:28,003 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:28,003 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:28,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360998, now seen corresponding path program 1 times [2019-12-27 00:35:28,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:28,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525014983] [2019-12-27 00:35:28,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:28,707 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:35:28,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525014983] [2019-12-27 00:35:28,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:28,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:28,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586281764] [2019-12-27 00:35:28,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:28,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:28,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:28,709 INFO L87 Difference]: Start difference. First operand 6003 states and 19104 transitions. Second operand 16 states. [2019-12-27 00:35:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:31,466 INFO L93 Difference]: Finished difference Result 7028 states and 22428 transitions. [2019-12-27 00:35:31,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:31,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:31,476 INFO L225 Difference]: With dead ends: 7028 [2019-12-27 00:35:31,476 INFO L226 Difference]: Without dead ends: 7028 [2019-12-27 00:35:31,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-27 00:35:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 4733. [2019-12-27 00:35:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-27 00:35:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-27 00:35:31,549 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-27 00:35:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:31,550 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-27 00:35:31,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-27 00:35:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:31,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:31,555 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:31,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash -122346011, now seen corresponding path program 3 times [2019-12-27 00:35:31,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:31,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498359568] [2019-12-27 00:35:31,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:31,945 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-12-27 00:35:32,241 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:35:32,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498359568] [2019-12-27 00:35:32,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:32,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:35:32,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949252215] [2019-12-27 00:35:32,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:35:32,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:35:32,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:35:32,242 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-27 00:35:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:34,853 INFO L93 Difference]: Finished difference Result 6548 states and 20998 transitions. [2019-12-27 00:35:34,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:35:34,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:34,863 INFO L225 Difference]: With dead ends: 6548 [2019-12-27 00:35:34,864 INFO L226 Difference]: Without dead ends: 6548 [2019-12-27 00:35:34,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:35:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-12-27 00:35:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 4733. [2019-12-27 00:35:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-27 00:35:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-27 00:35:34,984 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-27 00:35:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:34,984 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-27 00:35:34,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-27 00:35:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:34,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:34,989 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:34,989 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665119, now seen corresponding path program 4 times [2019-12-27 00:35:34,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:34,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918450754] [2019-12-27 00:35:34,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:35,399 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-12-27 00:35:35,718 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:35:35,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918450754] [2019-12-27 00:35:35,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:35,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:35:35,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249984789] [2019-12-27 00:35:35,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:35:35,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:35:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:35:35,722 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-27 00:35:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:38,695 INFO L93 Difference]: Finished difference Result 8491 states and 27602 transitions. [2019-12-27 00:35:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:35:38,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:38,708 INFO L225 Difference]: With dead ends: 8491 [2019-12-27 00:35:38,708 INFO L226 Difference]: Without dead ends: 8491 [2019-12-27 00:35:38,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-27 00:35:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 5468. [2019-12-27 00:35:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2019-12-27 00:35:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 17489 transitions. [2019-12-27 00:35:38,801 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 17489 transitions. Word has length 27 [2019-12-27 00:35:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:38,801 INFO L462 AbstractCegarLoop]: Abstraction has 5468 states and 17489 transitions. [2019-12-27 00:35:38,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 17489 transitions. [2019-12-27 00:35:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:38,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:38,808 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:38,808 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665118, now seen corresponding path program 2 times [2019-12-27 00:35:38,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:38,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131668745] [2019-12-27 00:35:38,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:39,348 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:35:39,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131668745] [2019-12-27 00:35:39,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:39,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:35:39,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364894962] [2019-12-27 00:35:39,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:35:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:35:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:35:39,351 INFO L87 Difference]: Start difference. First operand 5468 states and 17489 transitions. Second operand 15 states. [2019-12-27 00:35:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:42,733 INFO L93 Difference]: Finished difference Result 8491 states and 27482 transitions. [2019-12-27 00:35:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:35:42,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:42,745 INFO L225 Difference]: With dead ends: 8491 [2019-12-27 00:35:42,746 INFO L226 Difference]: Without dead ends: 8491 [2019-12-27 00:35:42,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-27 00:35:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 4739. [2019-12-27 00:35:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 00:35:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-27 00:35:42,828 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-27 00:35:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:42,828 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-27 00:35:42,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-27 00:35:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:42,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:42,836 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:42,836 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:42,836 INFO L82 PathProgramCache]: Analyzing trace with hash 14057405, now seen corresponding path program 5 times [2019-12-27 00:35:42,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:42,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398911529] [2019-12-27 00:35:42,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:43,216 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-27 00:35:43,335 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-27 00:35:43,556 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:35:43,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398911529] [2019-12-27 00:35:43,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:43,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:35:43,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773648073] [2019-12-27 00:35:43,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:35:43,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:35:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:35:43,558 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-27 00:35:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:46,339 INFO L93 Difference]: Finished difference Result 6594 states and 21127 transitions. [2019-12-27 00:35:46,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:35:46,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:46,348 INFO L225 Difference]: With dead ends: 6594 [2019-12-27 00:35:46,349 INFO L226 Difference]: Without dead ends: 6594 [2019-12-27 00:35:46,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:35:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2019-12-27 00:35:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4739. [2019-12-27 00:35:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 00:35:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-27 00:35:46,416 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-27 00:35:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:46,416 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-27 00:35:46,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-27 00:35:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:46,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:46,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:46,423 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775101, now seen corresponding path program 6 times [2019-12-27 00:35:46,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:46,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362534339] [2019-12-27 00:35:46,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:47,032 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:35:47,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362534339] [2019-12-27 00:35:47,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:47,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:35:47,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102324631] [2019-12-27 00:35:47,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:35:47,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:35:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:35:47,034 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-27 00:35:48,127 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-27 00:35:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:49,329 INFO L93 Difference]: Finished difference Result 6784 states and 21677 transitions. [2019-12-27 00:35:49,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:35:49,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 00:35:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:49,339 INFO L225 Difference]: With dead ends: 6784 [2019-12-27 00:35:49,340 INFO L226 Difference]: Without dead ends: 6784 [2019-12-27 00:35:49,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:35:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-12-27 00:35:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 4049. [2019-12-27 00:35:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-27 00:35:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12935 transitions. [2019-12-27 00:35:49,402 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12935 transitions. Word has length 27 [2019-12-27 00:35:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:49,403 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12935 transitions. [2019-12-27 00:35:49,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:35:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12935 transitions. [2019-12-27 00:35:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:49,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:49,406 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:49,406 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907358, now seen corresponding path program 7 times [2019-12-27 00:35:49,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:49,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639901459] [2019-12-27 00:35:49,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:50,116 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:35:50,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639901459] [2019-12-27 00:35:50,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:50,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:50,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601089688] [2019-12-27 00:35:50,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:50,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:50,117 INFO L87 Difference]: Start difference. First operand 4049 states and 12935 transitions. Second operand 16 states. [2019-12-27 00:35:51,708 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 00:35:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:53,143 INFO L93 Difference]: Finished difference Result 5954 states and 19287 transitions. [2019-12-27 00:35:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:53,143 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:53,152 INFO L225 Difference]: With dead ends: 5954 [2019-12-27 00:35:53,152 INFO L226 Difference]: Without dead ends: 5954 [2019-12-27 00:35:53,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-12-27 00:35:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 4739. [2019-12-27 00:35:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 00:35:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15273 transitions. [2019-12-27 00:35:53,225 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15273 transitions. Word has length 27 [2019-12-27 00:35:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:53,225 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15273 transitions. [2019-12-27 00:35:53,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15273 transitions. [2019-12-27 00:35:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:35:53,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:53,230 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, 1, 1, 1, 1, 1] [2019-12-27 00:35:53,230 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907357, now seen corresponding path program 2 times [2019-12-27 00:35:53,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:53,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519391224] [2019-12-27 00:35:53,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:53,746 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-12-27 00:35:53,986 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:35:53,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519391224] [2019-12-27 00:35:53,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:53,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:35:53,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316922410] [2019-12-27 00:35:53,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:35:53,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:35:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:35:53,988 INFO L87 Difference]: Start difference. First operand 4739 states and 15273 transitions. Second operand 16 states. [2019-12-27 00:35:55,279 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 00:35:55,574 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 00:35:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:57,077 INFO L93 Difference]: Finished difference Result 5954 states and 19167 transitions. [2019-12-27 00:35:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:35:57,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 00:35:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:57,086 INFO L225 Difference]: With dead ends: 5954 [2019-12-27 00:35:57,086 INFO L226 Difference]: Without dead ends: 5954 [2019-12-27 00:35:57,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:35:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-12-27 00:35:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3549. [2019-12-27 00:35:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-27 00:35:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-27 00:35:57,141 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-27 00:35:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:57,141 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-27 00:35:57,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:35:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-27 00:35:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:35:57,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:57,144 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:57,144 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:57,144 INFO L82 PathProgramCache]: Analyzing trace with hash 399516870, now seen corresponding path program 1 times [2019-12-27 00:35:57,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:57,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887866671] [2019-12-27 00:35:57,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:57,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:35:57,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887866671] [2019-12-27 00:35:57,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:57,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:35:57,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728093549] [2019-12-27 00:35:57,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:35:57,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:35:57,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:35:57,503 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 14 states. [2019-12-27 00:35:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:58,947 INFO L93 Difference]: Finished difference Result 9170 states and 29857 transitions. [2019-12-27 00:35:58,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:35:58,948 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-12-27 00:35:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:58,962 INFO L225 Difference]: With dead ends: 9170 [2019-12-27 00:35:58,963 INFO L226 Difference]: Without dead ends: 9170 [2019-12-27 00:35:58,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:35:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2019-12-27 00:35:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 7476. [2019-12-27 00:35:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-27 00:35:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24796 transitions. [2019-12-27 00:35:59,078 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24796 transitions. Word has length 30 [2019-12-27 00:35:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:59,079 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24796 transitions. [2019-12-27 00:35:59,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:35:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24796 transitions. [2019-12-27 00:35:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:35:59,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:59,085 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:59,085 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:35:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:59,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1461784035, now seen corresponding path program 1 times [2019-12-27 00:35:59,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:59,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574861910] [2019-12-27 00:35:59,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:59,902 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:35:59,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574861910] [2019-12-27 00:35:59,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:35:59,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 00:35:59,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352171653] [2019-12-27 00:35:59,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 00:35:59,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 00:35:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:35:59,904 INFO L87 Difference]: Start difference. First operand 7476 states and 24796 transitions. Second operand 18 states. [2019-12-27 00:36:00,384 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-27 00:36:00,559 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-27 00:36:00,800 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-27 00:36:01,210 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-12-27 00:36:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:04,051 INFO L93 Difference]: Finished difference Result 9691 states and 31784 transitions. [2019-12-27 00:36:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:36:04,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-27 00:36:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:04,066 INFO L225 Difference]: With dead ends: 9691 [2019-12-27 00:36:04,066 INFO L226 Difference]: Without dead ends: 9691 [2019-12-27 00:36:04,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2019-12-27 00:36:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-27 00:36:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 7916. [2019-12-27 00:36:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7916 states. [2019-12-27 00:36:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 26136 transitions. [2019-12-27 00:36:04,172 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 26136 transitions. Word has length 30 [2019-12-27 00:36:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:04,172 INFO L462 AbstractCegarLoop]: Abstraction has 7916 states and 26136 transitions. [2019-12-27 00:36:04,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 00:36:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 26136 transitions. [2019-12-27 00:36:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:36:04,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:04,179 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:04,179 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:04,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:04,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1491245864, now seen corresponding path program 2 times [2019-12-27 00:36:04,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:04,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590465746] [2019-12-27 00:36:04,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:04,993 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:36:04,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590465746] [2019-12-27 00:36:04,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:04,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 00:36:04,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541245705] [2019-12-27 00:36:04,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:36:04,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:36:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:36:04,994 INFO L87 Difference]: Start difference. First operand 7916 states and 26136 transitions. Second operand 19 states. [2019-12-27 00:36:05,724 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 00:36:05,875 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-12-27 00:36:06,119 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 00:36:06,381 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 00:36:06,885 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2019-12-27 00:36:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:09,892 INFO L93 Difference]: Finished difference Result 11695 states and 38094 transitions. [2019-12-27 00:36:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 00:36:09,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 00:36:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:09,909 INFO L225 Difference]: With dead ends: 11695 [2019-12-27 00:36:09,909 INFO L226 Difference]: Without dead ends: 11695 [2019-12-27 00:36:09,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 00:36:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2019-12-27 00:36:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 8606. [2019-12-27 00:36:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8606 states. [2019-12-27 00:36:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 28226 transitions. [2019-12-27 00:36:10,030 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 28226 transitions. Word has length 30 [2019-12-27 00:36:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:10,030 INFO L462 AbstractCegarLoop]: Abstraction has 8606 states and 28226 transitions. [2019-12-27 00:36:10,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:36:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 28226 transitions. [2019-12-27 00:36:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:36:10,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:10,038 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:10,038 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash -674363086, now seen corresponding path program 3 times [2019-12-27 00:36:10,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:10,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908115141] [2019-12-27 00:36:10,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:10,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908115141] [2019-12-27 00:36:10,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:10,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:36:10,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814241296] [2019-12-27 00:36:10,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:36:10,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:36:10,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:36:10,316 INFO L87 Difference]: Start difference. First operand 8606 states and 28226 transitions. Second operand 13 states. [2019-12-27 00:36:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:12,749 INFO L93 Difference]: Finished difference Result 16343 states and 53192 transitions. [2019-12-27 00:36:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 00:36:12,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-27 00:36:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:12,776 INFO L225 Difference]: With dead ends: 16343 [2019-12-27 00:36:12,776 INFO L226 Difference]: Without dead ends: 16343 [2019-12-27 00:36:12,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2019-12-27 00:36:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16343 states. [2019-12-27 00:36:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16343 to 8766. [2019-12-27 00:36:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-27 00:36:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 28719 transitions. [2019-12-27 00:36:12,930 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 28719 transitions. Word has length 30 [2019-12-27 00:36:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:12,931 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 28719 transitions. [2019-12-27 00:36:12,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:36:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 28719 transitions. [2019-12-27 00:36:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:36:12,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:12,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:12,939 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1889101151, now seen corresponding path program 2 times [2019-12-27 00:36:12,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:12,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149340905] [2019-12-27 00:36:12,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:13,841 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:36:13,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149340905] [2019-12-27 00:36:13,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:13,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 00:36:13,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951327096] [2019-12-27 00:36:13,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 00:36:13,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 00:36:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:36:13,842 INFO L87 Difference]: Start difference. First operand 8766 states and 28719 transitions. Second operand 20 states. [2019-12-27 00:36:14,333 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-27 00:36:14,592 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 00:36:14,759 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-27 00:36:14,964 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-27 00:36:15,158 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-12-27 00:36:15,581 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-27 00:36:16,330 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-27 00:36:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:18,585 INFO L93 Difference]: Finished difference Result 13845 states and 45415 transitions. [2019-12-27 00:36:18,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 00:36:18,585 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 00:36:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:18,614 INFO L225 Difference]: With dead ends: 13845 [2019-12-27 00:36:18,614 INFO L226 Difference]: Without dead ends: 13845 [2019-12-27 00:36:18,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=275, Invalid=1131, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 00:36:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13845 states. [2019-12-27 00:36:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13845 to 8766. [2019-12-27 00:36:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-27 00:36:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 28719 transitions. [2019-12-27 00:36:18,761 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 28719 transitions. Word has length 30 [2019-12-27 00:36:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:18,762 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 28719 transitions. [2019-12-27 00:36:18,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 00:36:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 28719 transitions. [2019-12-27 00:36:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:36:18,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:18,771 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:18,771 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1617209505, now seen corresponding path program 3 times [2019-12-27 00:36:18,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:18,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710189637] [2019-12-27 00:36:18,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:18,999 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:36:18,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710189637] [2019-12-27 00:36:19,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:19,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:36:19,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137849893] [2019-12-27 00:36:19,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:36:19,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:36:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:36:19,001 INFO L87 Difference]: Start difference. First operand 8766 states and 28719 transitions. Second operand 12 states. [2019-12-27 00:36:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:21,059 INFO L93 Difference]: Finished difference Result 18715 states and 61217 transitions. [2019-12-27 00:36:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 00:36:21,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-27 00:36:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:21,089 INFO L225 Difference]: With dead ends: 18715 [2019-12-27 00:36:21,089 INFO L226 Difference]: Without dead ends: 18715 [2019-12-27 00:36:21,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-12-27 00:36:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2019-12-27 00:36:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 11665. [2019-12-27 00:36:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11665 states. [2019-12-27 00:36:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11665 states to 11665 states and 38711 transitions. [2019-12-27 00:36:21,881 INFO L78 Accepts]: Start accepts. Automaton has 11665 states and 38711 transitions. Word has length 30 [2019-12-27 00:36:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:21,881 INFO L462 AbstractCegarLoop]: Abstraction has 11665 states and 38711 transitions. [2019-12-27 00:36:21,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:36:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11665 states and 38711 transitions. [2019-12-27 00:36:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:36:21,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:21,893 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:21,894 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:21,894 INFO L82 PathProgramCache]: Analyzing trace with hash -980323325, now seen corresponding path program 4 times [2019-12-27 00:36:21,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:21,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590696474] [2019-12-27 00:36:21,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:22,639 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:36:22,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590696474] [2019-12-27 00:36:22,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:22,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 00:36:22,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188138897] [2019-12-27 00:36:22,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 00:36:22,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:22,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 00:36:22,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:36:22,640 INFO L87 Difference]: Start difference. First operand 11665 states and 38711 transitions. Second operand 18 states. [2019-12-27 00:36:23,457 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-27 00:36:23,733 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-27 00:36:24,212 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-27 00:36:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:27,419 INFO L93 Difference]: Finished difference Result 16258 states and 54181 transitions. [2019-12-27 00:36:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:36:27,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-27 00:36:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:27,445 INFO L225 Difference]: With dead ends: 16258 [2019-12-27 00:36:27,445 INFO L226 Difference]: Without dead ends: 16258 [2019-12-27 00:36:27,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 00:36:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16258 states. [2019-12-27 00:36:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16258 to 10703. [2019-12-27 00:36:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10703 states. [2019-12-27 00:36:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 35787 transitions. [2019-12-27 00:36:27,736 INFO L78 Accepts]: Start accepts. Automaton has 10703 states and 35787 transitions. Word has length 30 [2019-12-27 00:36:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:27,736 INFO L462 AbstractCegarLoop]: Abstraction has 10703 states and 35787 transitions. [2019-12-27 00:36:27,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 00:36:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 10703 states and 35787 transitions. [2019-12-27 00:36:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:36:27,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:27,746 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:27,746 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 784664900, now seen corresponding path program 4 times [2019-12-27 00:36:27,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:27,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41108891] [2019-12-27 00:36:27,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:28,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41108891] [2019-12-27 00:36:28,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:28,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 00:36:28,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905685166] [2019-12-27 00:36:28,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:36:28,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:36:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:36:28,532 INFO L87 Difference]: Start difference. First operand 10703 states and 35787 transitions. Second operand 19 states. [2019-12-27 00:36:29,233 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 00:36:29,497 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-27 00:36:29,755 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-12-27 00:36:30,257 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2019-12-27 00:36:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:33,207 INFO L93 Difference]: Finished difference Result 15068 states and 50426 transitions. [2019-12-27 00:36:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 00:36:33,207 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 00:36:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:33,231 INFO L225 Difference]: With dead ends: 15068 [2019-12-27 00:36:33,231 INFO L226 Difference]: Without dead ends: 15068 [2019-12-27 00:36:33,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 00:36:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15068 states. [2019-12-27 00:36:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15068 to 9523. [2019-12-27 00:36:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9523 states. [2019-12-27 00:36:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9523 states to 9523 states and 32062 transitions. [2019-12-27 00:36:33,382 INFO L78 Accepts]: Start accepts. Automaton has 9523 states and 32062 transitions. Word has length 30 [2019-12-27 00:36:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:33,382 INFO L462 AbstractCegarLoop]: Abstraction has 9523 states and 32062 transitions. [2019-12-27 00:36:33,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:36:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 9523 states and 32062 transitions. [2019-12-27 00:36:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:36:33,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:33,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:33,391 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -838148739, now seen corresponding path program 1 times [2019-12-27 00:36:33,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:33,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991058016] [2019-12-27 00:36:33,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:34,295 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:36:34,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991058016] [2019-12-27 00:36:34,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:34,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 00:36:34,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749164508] [2019-12-27 00:36:34,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 00:36:34,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 00:36:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:36:34,296 INFO L87 Difference]: Start difference. First operand 9523 states and 32062 transitions. Second operand 18 states. [2019-12-27 00:36:35,590 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-27 00:36:35,749 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-27 00:36:35,898 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-27 00:36:36,223 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-27 00:36:36,382 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-27 00:36:36,813 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-27 00:36:36,980 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-27 00:36:37,145 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:36:37,607 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-12-27 00:36:37,795 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 00:36:38,228 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-27 00:36:38,421 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-12-27 00:36:39,342 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-27 00:36:39,846 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-27 00:36:40,146 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-12-27 00:36:40,313 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 00:36:40,488 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-27 00:36:40,743 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-27 00:36:40,947 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-27 00:36:41,143 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 00:36:41,497 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 00:36:41,724 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-27 00:36:41,917 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-27 00:36:42,136 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-12-27 00:36:42,392 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-12-27 00:36:42,631 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-27 00:36:42,948 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-12-27 00:36:43,223 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-27 00:36:43,529 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-27 00:36:43,797 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-27 00:36:44,273 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-12-27 00:36:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:44,599 INFO L93 Difference]: Finished difference Result 10433 states and 34812 transitions. [2019-12-27 00:36:44,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 00:36:44,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-12-27 00:36:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:44,615 INFO L225 Difference]: With dead ends: 10433 [2019-12-27 00:36:44,615 INFO L226 Difference]: Without dead ends: 10433 [2019-12-27 00:36:44,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1093, Invalid=2689, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 00:36:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10433 states. [2019-12-27 00:36:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10433 to 10073. [2019-12-27 00:36:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10073 states. [2019-12-27 00:36:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 33752 transitions. [2019-12-27 00:36:44,743 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 33752 transitions. Word has length 31 [2019-12-27 00:36:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:44,744 INFO L462 AbstractCegarLoop]: Abstraction has 10073 states and 33752 transitions. [2019-12-27 00:36:44,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 00:36:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 33752 transitions. [2019-12-27 00:36:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:36:44,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:44,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:44,753 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1965024921, now seen corresponding path program 2 times [2019-12-27 00:36:44,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:44,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348167839] [2019-12-27 00:36:44,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:45,740 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:36:45,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348167839] [2019-12-27 00:36:45,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:45,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 00:36:45,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092427777] [2019-12-27 00:36:45,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:36:45,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:45,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:36:45,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:36:45,742 INFO L87 Difference]: Start difference. First operand 10073 states and 33752 transitions. Second operand 19 states. [2019-12-27 00:36:47,330 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-27 00:36:47,479 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-27 00:36:47,623 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-12-27 00:36:47,999 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-12-27 00:36:48,165 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-27 00:36:48,631 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 00:36:48,801 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-27 00:36:48,977 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-12-27 00:36:49,484 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-12-27 00:36:49,675 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-27 00:36:50,160 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-27 00:36:50,356 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-12-27 00:36:51,565 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-12-27 00:36:51,819 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-27 00:36:51,971 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-27 00:36:52,446 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-27 00:36:52,637 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-27 00:36:52,827 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:36:53,010 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-27 00:36:53,265 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-27 00:36:53,475 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-12-27 00:36:53,680 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-27 00:36:54,052 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-27 00:36:54,291 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 00:36:54,492 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-27 00:36:54,700 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-12-27 00:36:54,955 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-12-27 00:36:55,183 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-12-27 00:36:55,477 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2019-12-27 00:36:55,756 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-27 00:36:56,072 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-12-27 00:36:56,351 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-12-27 00:36:56,852 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-12-27 00:36:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:57,176 INFO L93 Difference]: Finished difference Result 10623 states and 35402 transitions. [2019-12-27 00:36:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 00:36:57,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 00:36:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:57,191 INFO L225 Difference]: With dead ends: 10623 [2019-12-27 00:36:57,192 INFO L226 Difference]: Without dead ends: 10623 [2019-12-27 00:36:57,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1275, Invalid=3417, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 00:36:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10623 states. [2019-12-27 00:36:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10623 to 10033. [2019-12-27 00:36:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10033 states. [2019-12-27 00:36:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10033 states to 10033 states and 33632 transitions. [2019-12-27 00:36:57,323 INFO L78 Accepts]: Start accepts. Automaton has 10033 states and 33632 transitions. Word has length 31 [2019-12-27 00:36:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:57,323 INFO L462 AbstractCegarLoop]: Abstraction has 10033 states and 33632 transitions. [2019-12-27 00:36:57,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:36:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10033 states and 33632 transitions. [2019-12-27 00:36:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:36:57,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:57,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:57,333 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:36:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 288220857, now seen corresponding path program 3 times [2019-12-27 00:36:57,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:57,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443682207] [2019-12-27 00:36:57,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:58,271 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:36:58,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443682207] [2019-12-27 00:36:58,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:58,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 00:36:58,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807977686] [2019-12-27 00:36:58,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:36:58,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:36:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:36:58,273 INFO L87 Difference]: Start difference. First operand 10033 states and 33632 transitions. Second operand 19 states. [2019-12-27 00:36:59,391 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-27 00:37:00,046 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-27 00:37:00,196 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-27 00:37:00,600 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-12-27 00:37:00,783 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-12-27 00:37:01,371 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-27 00:37:01,560 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-12-27 00:37:01,741 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-27 00:37:01,893 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-27 00:37:02,355 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-27 00:37:02,554 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-12-27 00:37:02,727 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-27 00:37:03,351 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-27 00:37:03,552 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-27 00:37:03,757 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-27 00:37:04,605 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-27 00:37:04,816 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-12-27 00:37:05,368 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-12-27 00:37:05,581 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-27 00:37:06,104 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2019-12-27 00:37:06,610 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-27 00:37:08,392 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-27 00:37:08,718 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-27 00:37:08,946 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2019-12-27 00:37:09,359 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-12-27 00:37:09,597 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-27 00:37:10,002 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-12-27 00:37:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:10,491 INFO L93 Difference]: Finished difference Result 13018 states and 43428 transitions. [2019-12-27 00:37:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 00:37:10,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 00:37:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:10,512 INFO L225 Difference]: With dead ends: 13018 [2019-12-27 00:37:10,512 INFO L226 Difference]: Without dead ends: 13018 [2019-12-27 00:37:10,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1074, Invalid=3482, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 00:37:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13018 states. [2019-12-27 00:37:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13018 to 10769. [2019-12-27 00:37:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10769 states. [2019-12-27 00:37:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10769 states to 10769 states and 36006 transitions. [2019-12-27 00:37:10,670 INFO L78 Accepts]: Start accepts. Automaton has 10769 states and 36006 transitions. Word has length 31 [2019-12-27 00:37:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:10,670 INFO L462 AbstractCegarLoop]: Abstraction has 10769 states and 36006 transitions. [2019-12-27 00:37:10,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:37:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10769 states and 36006 transitions. [2019-12-27 00:37:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:37:10,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:10,680 INFO L410 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:10,681 INFO L82 PathProgramCache]: Analyzing trace with hash 288220858, now seen corresponding path program 1 times [2019-12-27 00:37:10,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:10,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264922637] [2019-12-27 00:37:10,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:11,448 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:37:11,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264922637] [2019-12-27 00:37:11,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:11,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 00:37:11,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572521946] [2019-12-27 00:37:11,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:37:11,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:37:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:37:11,450 INFO L87 Difference]: Start difference. First operand 10769 states and 36006 transitions. Second operand 19 states. [2019-12-27 00:37:13,041 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-27 00:37:13,206 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-12-27 00:37:13,344 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-12-27 00:37:13,714 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-27 00:37:13,888 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-27 00:37:14,416 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-12-27 00:37:14,590 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-27 00:37:14,759 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-27 00:37:15,239 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-12-27 00:37:15,428 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-27 00:37:15,847 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-12-27 00:37:16,045 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-27 00:37:16,994 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-27 00:37:17,375 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-27 00:37:17,831 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-27 00:37:18,008 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-27 00:37:18,176 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-27 00:37:18,353 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-27 00:37:18,595 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-27 00:37:18,804 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-27 00:37:19,144 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-27 00:37:19,488 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-27 00:37:19,730 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-27 00:37:19,916 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 00:37:20,062 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-27 00:37:20,256 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-27 00:37:20,507 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-27 00:37:20,720 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-27 00:37:21,013 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-12-27 00:37:21,287 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-12-27 00:37:21,586 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-12-27 00:37:21,862 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-27 00:37:22,268 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2019-12-27 00:37:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:22,461 INFO L93 Difference]: Finished difference Result 10841 states and 36198 transitions. [2019-12-27 00:37:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 00:37:22,462 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 00:37:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:22,477 INFO L225 Difference]: With dead ends: 10841 [2019-12-27 00:37:22,477 INFO L226 Difference]: Without dead ends: 10841 [2019-12-27 00:37:22,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1376, Invalid=3594, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 00:37:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10841 states. [2019-12-27 00:37:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10841 to 10571. [2019-12-27 00:37:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10571 states. [2019-12-27 00:37:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10571 states to 10571 states and 35408 transitions. [2019-12-27 00:37:22,611 INFO L78 Accepts]: Start accepts. Automaton has 10571 states and 35408 transitions. Word has length 31 [2019-12-27 00:37:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:22,611 INFO L462 AbstractCegarLoop]: Abstraction has 10571 states and 35408 transitions. [2019-12-27 00:37:22,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:37:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10571 states and 35408 transitions. [2019-12-27 00:37:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:37:22,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:22,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:22,621 INFO L410 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1133622845, now seen corresponding path program 4 times [2019-12-27 00:37:22,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:22,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146080694] [2019-12-27 00:37:22,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:23,471 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:37:23,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146080694] [2019-12-27 00:37:23,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:23,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 00:37:23,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398823490] [2019-12-27 00:37:23,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 00:37:23,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 00:37:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:23,473 INFO L87 Difference]: Start difference. First operand 10571 states and 35408 transitions. Second operand 20 states. [2019-12-27 00:37:25,186 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-12-27 00:37:25,750 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-27 00:37:25,952 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-27 00:37:26,149 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-12-27 00:37:26,577 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-12-27 00:37:26,852 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 00:37:27,063 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-12-27 00:37:27,630 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-27 00:37:27,822 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-12-27 00:37:28,097 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-12-27 00:37:28,617 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-27 00:37:28,872 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-12-27 00:37:29,487 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-12-27 00:37:29,698 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-27 00:37:30,871 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-12-27 00:37:31,727 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-27 00:37:31,885 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-12-27 00:37:32,385 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-27 00:37:32,573 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-27 00:37:32,760 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-12-27 00:37:32,979 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-27 00:37:33,226 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 00:37:33,579 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-12-27 00:37:33,808 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2019-12-27 00:37:34,078 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-12-27 00:37:34,355 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 00:37:34,632 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-12-27 00:37:35,001 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-27 00:37:35,295 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-27 00:37:35,584 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2019-12-27 00:37:35,833 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-27 00:37:36,186 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2019-12-27 00:37:36,493 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-12-27 00:37:36,884 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2019-12-27 00:37:37,237 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-12-27 00:37:37,914 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2019-12-27 00:37:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:38,515 INFO L93 Difference]: Finished difference Result 13980 states and 45749 transitions. [2019-12-27 00:37:38,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 00:37:38,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-27 00:37:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:38,534 INFO L225 Difference]: With dead ends: 13980 [2019-12-27 00:37:38,534 INFO L226 Difference]: Without dead ends: 13980 [2019-12-27 00:37:38,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1798, Invalid=5342, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 00:37:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2019-12-27 00:37:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 11287. [2019-12-27 00:37:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11287 states. [2019-12-27 00:37:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11287 states to 11287 states and 37640 transitions. [2019-12-27 00:37:38,691 INFO L78 Accepts]: Start accepts. Automaton has 11287 states and 37640 transitions. Word has length 31 [2019-12-27 00:37:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:38,691 INFO L462 AbstractCegarLoop]: Abstraction has 11287 states and 37640 transitions. [2019-12-27 00:37:38,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 00:37:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 11287 states and 37640 transitions. [2019-12-27 00:37:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:37:38,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:38,702 INFO L410 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1257314425, now seen corresponding path program 5 times [2019-12-27 00:37:38,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:38,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419616417] [2019-12-27 00:37:38,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:39,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:37:39,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419616417] [2019-12-27 00:37:39,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:39,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 00:37:39,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303796638] [2019-12-27 00:37:39,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 00:37:39,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:39,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 00:37:39,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:39,555 INFO L87 Difference]: Start difference. First operand 11287 states and 37640 transitions. Second operand 20 states. [2019-12-27 00:37:41,334 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 00:37:41,842 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-27 00:37:42,054 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-27 00:37:42,424 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-27 00:37:42,588 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-12-27 00:37:43,117 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-27 00:37:43,797 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-12-27 00:37:45,253 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-27 00:37:45,409 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-27 00:37:45,576 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-12-27 00:37:46,050 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-27 00:37:46,245 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-27 00:37:46,440 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-27 00:37:46,590 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-12-27 00:37:46,771 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-27 00:37:47,029 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-27 00:37:47,227 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-12-27 00:37:47,423 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-27 00:37:47,641 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-12-27 00:37:47,994 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-12-27 00:37:48,215 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-27 00:37:48,435 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-12-27 00:37:48,621 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-27 00:37:48,928 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-12-27 00:37:49,162 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-12-27 00:37:49,402 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-27 00:37:49,737 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-12-27 00:37:49,991 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-12-27 00:37:50,205 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-12-27 00:37:50,739 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-12-27 00:37:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:51,081 INFO L93 Difference]: Finished difference Result 13232 states and 43437 transitions. [2019-12-27 00:37:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 00:37:51,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-27 00:37:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:51,100 INFO L225 Difference]: With dead ends: 13232 [2019-12-27 00:37:51,100 INFO L226 Difference]: Without dead ends: 13232 [2019-12-27 00:37:51,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1327, Invalid=3643, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 00:37:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13232 states. [2019-12-27 00:37:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13232 to 11427. [2019-12-27 00:37:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11427 states. [2019-12-27 00:37:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11427 states to 11427 states and 38020 transitions. [2019-12-27 00:37:51,255 INFO L78 Accepts]: Start accepts. Automaton has 11427 states and 38020 transitions. Word has length 31 [2019-12-27 00:37:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:51,256 INFO L462 AbstractCegarLoop]: Abstraction has 11427 states and 38020 transitions. [2019-12-27 00:37:51,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 00:37:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 11427 states and 38020 transitions. [2019-12-27 00:37:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:37:51,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:51,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:51,266 INFO L410 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1263078073, now seen corresponding path program 6 times [2019-12-27 00:37:51,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:51,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108062688] [2019-12-27 00:37:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:51,901 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-12-27 00:37:52,384 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:37:52,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108062688] [2019-12-27 00:37:52,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:52,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 00:37:52,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636374243] [2019-12-27 00:37:52,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 00:37:52,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 00:37:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:52,386 INFO L87 Difference]: Start difference. First operand 11427 states and 38020 transitions. Second operand 20 states. [2019-12-27 00:37:53,651 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-27 00:37:54,171 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-27 00:37:55,196 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-27 00:37:55,355 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-27 00:37:55,536 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-27 00:37:55,709 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 00:37:55,853 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-27 00:37:56,067 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-27 00:37:56,269 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-27 00:37:56,453 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 00:37:56,729 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-12-27 00:37:56,932 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-27 00:37:57,124 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-27 00:37:57,333 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-12-27 00:37:57,557 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-12-27 00:37:57,786 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-12-27 00:37:58,118 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-27 00:37:58,362 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-12-27 00:37:58,693 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-12-27 00:37:58,931 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-12-27 00:37:59,430 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-27 00:37:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:59,717 INFO L93 Difference]: Finished difference Result 13166 states and 43235 transitions. [2019-12-27 00:37:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 00:37:59,717 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-27 00:37:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:59,737 INFO L225 Difference]: With dead ends: 13166 [2019-12-27 00:37:59,737 INFO L226 Difference]: Without dead ends: 13166 [2019-12-27 00:37:59,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=719, Invalid=1831, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 00:37:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2019-12-27 00:37:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 11373. [2019-12-27 00:37:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2019-12-27 00:37:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 37854 transitions. [2019-12-27 00:37:59,896 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 37854 transitions. Word has length 31 [2019-12-27 00:37:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:59,896 INFO L462 AbstractCegarLoop]: Abstraction has 11373 states and 37854 transitions. [2019-12-27 00:37:59,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 00:37:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 37854 transitions. [2019-12-27 00:37:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:37:59,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:59,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:59,905 INFO L410 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2096638671, now seen corresponding path program 7 times [2019-12-27 00:37:59,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:59,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621469209] [2019-12-27 00:37:59,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:00,659 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-12-27 00:38:00,986 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-12-27 00:38:01,193 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 46 [2019-12-27 00:38:01,377 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:38:01,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621469209] [2019-12-27 00:38:01,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:01,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 00:38:01,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920042477] [2019-12-27 00:38:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:38:01,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:38:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:38:01,379 INFO L87 Difference]: Start difference. First operand 11373 states and 37854 transitions. Second operand 19 states. [2019-12-27 00:38:03,973 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:38:04,523 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-12-27 00:38:04,994 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-12-27 00:38:05,701 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-12-27 00:38:06,123 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-27 00:38:06,645 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-27 00:38:06,802 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-12-27 00:38:07,105 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-27 00:38:07,394 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-27 00:38:07,788 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-27 00:38:08,140 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-12-27 00:38:08,477 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2019-12-27 00:38:08,901 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 77 [2019-12-27 00:38:09,143 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-12-27 00:38:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:09,426 INFO L93 Difference]: Finished difference Result 13191 states and 43298 transitions. [2019-12-27 00:38:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 00:38:09,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 00:38:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:09,445 INFO L225 Difference]: With dead ends: 13191 [2019-12-27 00:38:09,445 INFO L226 Difference]: Without dead ends: 13191 [2019-12-27 00:38:09,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=680, Invalid=1770, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 00:38:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13191 states. [2019-12-27 00:38:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13191 to 11433. [2019-12-27 00:38:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2019-12-27 00:38:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 38014 transitions. [2019-12-27 00:38:09,613 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 38014 transitions. Word has length 31 [2019-12-27 00:38:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:09,614 INFO L462 AbstractCegarLoop]: Abstraction has 11433 states and 38014 transitions. [2019-12-27 00:38:09,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:38:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 38014 transitions. [2019-12-27 00:38:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:38:09,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:09,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:09,624 INFO L410 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash -576884563, now seen corresponding path program 8 times [2019-12-27 00:38:09,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:09,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457479098] [2019-12-27 00:38:09,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:10,769 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-12-27 00:38:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:10,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457479098] [2019-12-27 00:38:10,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:10,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 00:38:10,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76340987] [2019-12-27 00:38:10,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 00:38:10,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:10,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 00:38:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:38:10,778 INFO L87 Difference]: Start difference. First operand 11433 states and 38014 transitions. Second operand 19 states. [2019-12-27 00:38:12,650 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-27 00:38:13,158 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-12-27 00:38:13,580 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-27 00:38:14,153 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2019-12-27 00:38:14,375 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-27 00:38:14,835 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-27 00:38:15,029 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-12-27 00:38:15,856 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-27 00:38:16,682 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-27 00:38:16,841 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-12-27 00:38:17,112 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-27 00:38:17,365 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-27 00:38:17,563 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-12-27 00:38:17,845 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-27 00:38:18,163 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-27 00:38:18,523 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-12-27 00:38:18,805 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-12-27 00:38:19,091 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2019-12-27 00:38:19,350 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-12-27 00:38:19,825 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2019-12-27 00:38:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:20,155 INFO L93 Difference]: Finished difference Result 13348 states and 43769 transitions. [2019-12-27 00:38:20,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 00:38:20,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 00:38:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:20,175 INFO L225 Difference]: With dead ends: 13348 [2019-12-27 00:38:20,175 INFO L226 Difference]: Without dead ends: 13348 [2019-12-27 00:38:20,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=893, Invalid=2187, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 00:38:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13348 states. [2019-12-27 00:38:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13348 to 11447. [2019-12-27 00:38:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11447 states. [2019-12-27 00:38:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 38056 transitions. [2019-12-27 00:38:20,330 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 38056 transitions. Word has length 31 [2019-12-27 00:38:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:20,330 INFO L462 AbstractCegarLoop]: Abstraction has 11447 states and 38056 transitions. [2019-12-27 00:38:20,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 00:38:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 38056 transitions. [2019-12-27 00:38:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:38:20,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:20,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:20,340 INFO L410 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash 344966205, now seen corresponding path program 9 times [2019-12-27 00:38:20,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:20,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578460900] [2019-12-27 00:38:20,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:21,598 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-12-27 00:38:21,674 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:38:21,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578460900] [2019-12-27 00:38:21,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:21,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 00:38:21,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228707140] [2019-12-27 00:38:21,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 00:38:21,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 00:38:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:38:21,676 INFO L87 Difference]: Start difference. First operand 11447 states and 38056 transitions. Second operand 18 states. [2019-12-27 00:38:23,743 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-27 00:38:23,901 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-27 00:38:24,123 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-27 00:38:24,364 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-27 00:38:24,663 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-27 00:38:24,881 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-27 00:38:25,141 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-27 00:38:25,314 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-27 00:38:25,577 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 00:38:25,844 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-27 00:38:26,172 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-27 00:38:26,414 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 00:38:26,877 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-12-27 00:38:27,085 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-12-27 00:38:27,948 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 Received shutdown request... [2019-12-27 00:38:28,117 WARN L209 SmtUtils]: Removed 3 from assertion stack [2019-12-27 00:38:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 00:38:28,118 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:38:28,121 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:38:28,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:38:28 BasicIcfg [2019-12-27 00:38:28,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:38:28,122 INFO L168 Benchmark]: Toolchain (without parser) took 244490.94 ms. Allocated memory was 137.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 100.1 MB in the beginning and 884.7 MB in the end (delta: -784.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 00:38:28,123 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 00:38:28,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 951.66 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 122.3 MB in the end (delta: -22.6 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:28,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.52 ms. Allocated memory is still 201.3 MB. Free memory was 122.3 MB in the beginning and 119.5 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:38:28,123 INFO L168 Benchmark]: Boogie Preprocessor took 42.62 ms. Allocated memory is still 201.3 MB. Free memory was 119.5 MB in the beginning and 116.7 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:38:28,124 INFO L168 Benchmark]: RCFGBuilder took 716.87 ms. Allocated memory was 201.3 MB in the beginning and 233.8 MB in the end (delta: 32.5 MB). Free memory was 116.7 MB in the beginning and 194.2 MB in the end (delta: -77.5 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:28,124 INFO L168 Benchmark]: TraceAbstraction took 242691.68 ms. Allocated memory was 233.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 194.2 MB in the beginning and 884.7 MB in the end (delta: -690.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 00:38:28,125 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 951.66 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.7 MB in the beginning and 122.3 MB in the end (delta: -22.6 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.52 ms. Allocated memory is still 201.3 MB. Free memory was 122.3 MB in the beginning and 119.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.62 ms. Allocated memory is still 201.3 MB. Free memory was 119.5 MB in the beginning and 116.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.87 ms. Allocated memory was 201.3 MB in the beginning and 233.8 MB in the end (delta: 32.5 MB). Free memory was 116.7 MB in the beginning and 194.2 MB in the end (delta: -77.5 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242691.68 ms. Allocated memory was 233.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 194.2 MB in the beginning and 884.7 MB in the end (delta: -690.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 6 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 118 SemBasedMoverChecksPositive, 118 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 20924 CheckedPairsTotal, 153 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (11447states) and FLOYD_HOARE automaton (currently 39 states, 18 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 62 for 44ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (11447states) and FLOYD_HOARE automaton (currently 39 states, 18 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 62 for 44ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (11447states) and FLOYD_HOARE automaton (currently 39 states, 18 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 62 for 44ms.. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (11447states) and FLOYD_HOARE automaton (currently 39 states, 18 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 62 for 44ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 242.5s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 199.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2995 SDtfs, 14512 SDslu, 14166 SDs, 0 SdLazy, 88123 SolverSat, 1671 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1512 GetRequests, 33 SyntacticMatches, 35 SemanticMatches, 1443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10070 ImplicationChecksByTransitivity, 118.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11665occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 42 MinimizatonAttempts, 92483 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 1194 NumberOfCodeBlocks, 1194 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1151 ConstructedInterpolants, 0 QuantifiedInterpolants, 926311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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 could not prove your program: Timeout Completed graceful shutdown