/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:30:02,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:30:02,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:30:02,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:30:02,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:30:02,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:30:02,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:30:02,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:30:02,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:30:02,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:30:02,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:30:02,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:30:02,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:30:02,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:30:02,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:30:02,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:30:02,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:30:02,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:30:02,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:30:02,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:30:02,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:30:02,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:30:02,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:30:02,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:30:02,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:30:02,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:30:02,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:30:02,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:30:02,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:30:02,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:30:02,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:30:02,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:30:02,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:30:02,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:30:02,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:30:02,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:30:02,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:30:02,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:30:02,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:30:02,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:30:02,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:30:02,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:30:02,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:30:02,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:30:02,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:30:02,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:30:02,644 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:30:02,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:30:02,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:30:02,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:30:02,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:30:02,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:30:02,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:30:02,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:30:02,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:30:02,645 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:30:02,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:30:02,646 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:30:02,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:30:02,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:30:02,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:30:02,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:30:02,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:30:02,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:30:02,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:30:02,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:30:02,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:30:02,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:30:02,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:30:02,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:30:02,650 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:30:02,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:30:02,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:30:02,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:30:02,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:30:02,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:30:02,950 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:30:02,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2019-12-18 15:30:03,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4569959e7/f07054ff9a4f4d0b9cd6ade492e37fb7/FLAG40d4f7540 [2019-12-18 15:30:03,637 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:30:03,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2019-12-18 15:30:03,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4569959e7/f07054ff9a4f4d0b9cd6ade492e37fb7/FLAG40d4f7540 [2019-12-18 15:30:03,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4569959e7/f07054ff9a4f4d0b9cd6ade492e37fb7 [2019-12-18 15:30:03,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:30:03,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:30:03,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:30:03,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:30:03,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:30:03,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:30:03" (1/1) ... [2019-12-18 15:30:03,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70263d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:03, skipping insertion in model container [2019-12-18 15:30:03,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:30:03" (1/1) ... [2019-12-18 15:30:03,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:30:03,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:30:04,156 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:30:04,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:30:04,632 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:30:04,645 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:30:04,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:30:04,885 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:30:04,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04 WrapperNode [2019-12-18 15:30:04,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:30:04,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:30:04,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:30:04,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:30:04,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:30:04,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:30:04,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:30:04,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:30:04,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... [2019-12-18 15:30:04,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:30:04,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:30:04,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:30:04,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:30:04,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:30:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-18 15:30:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-18 15:30:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-18 15:30:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-18 15:30:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:30:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:30:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:30:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:30:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 15:30:05,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 15:30:05,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:30:05,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:30:05,076 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:30:05,744 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:30:05,745 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-18 15:30:05,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:30:05 BoogieIcfgContainer [2019-12-18 15:30:05,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:30:05,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:30:05,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:30:05,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:30:05,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:30:03" (1/3) ... [2019-12-18 15:30:05,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af4c18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:30:05, skipping insertion in model container [2019-12-18 15:30:05,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:04" (2/3) ... [2019-12-18 15:30:05,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af4c18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:30:05, skipping insertion in model container [2019-12-18 15:30:05,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:30:05" (3/3) ... [2019-12-18 15:30:05,755 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2019-12-18 15:30:05,766 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:30:05,766 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:30:05,774 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-18 15:30:05,775 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:30:05,817 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,818 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,818 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,819 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,819 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,819 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,820 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,820 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,820 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,820 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,820 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,821 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,822 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,822 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,822 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,822 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,822 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,823 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,823 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,823 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,823 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,823 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,824 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,824 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,824 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,825 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,825 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,825 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,825 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,825 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,825 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,826 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,827 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,827 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,828 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,828 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,828 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,829 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,829 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,829 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,829 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,829 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,829 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,830 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,830 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,830 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,830 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,830 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,830 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,831 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,831 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,831 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,831 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,831 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,832 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,833 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,833 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,833 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,833 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,833 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,834 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,834 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,834 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,835 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,835 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,835 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,835 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,835 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,835 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,836 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,836 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,836 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,836 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,836 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,836 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,837 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,838 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,838 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,838 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,839 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,839 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,839 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,839 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,840 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,840 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,840 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,840 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,840 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,841 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,841 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,841 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,841 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,841 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,842 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,842 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,842 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,843 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,846 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,846 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,848 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,848 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,849 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,849 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,849 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,849 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,850 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,850 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,850 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,850 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,851 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,851 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,851 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,851 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,851 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,852 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,852 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,853 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,853 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,853 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,853 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,854 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,854 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,854 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,854 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,854 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,854 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,855 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,855 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,855 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,855 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,855 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,856 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,856 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,856 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,856 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,856 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,856 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,857 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,857 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,857 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,857 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,857 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,858 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,858 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,858 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,858 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,858 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,859 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,859 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,859 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,859 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,860 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,860 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,860 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,860 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,860 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,860 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,861 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,861 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,861 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,861 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,861 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,862 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,862 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,862 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,862 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,862 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,862 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,863 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,863 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,863 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,863 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,863 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,863 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,864 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,864 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,864 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,864 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,864 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,864 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,865 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,865 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,865 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,865 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,865 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,865 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,866 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,866 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,866 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,866 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,866 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,867 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,867 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,867 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,867 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,867 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,867 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,868 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,868 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,868 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,868 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,868 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,869 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,869 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,869 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,869 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,869 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,869 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,870 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,870 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,870 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,870 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,870 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,871 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,871 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,874 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,875 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,875 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,875 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,875 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,875 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,876 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,876 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,876 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,876 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,876 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,877 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,877 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,877 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,877 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,877 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,878 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,878 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,878 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,878 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,878 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,878 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,879 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,879 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,879 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,879 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,879 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,880 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,880 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,880 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,880 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,880 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,881 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,881 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,881 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,886 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,887 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,887 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,887 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,887 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,887 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,888 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,888 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,888 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,888 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,888 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,888 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,889 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,889 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,889 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,889 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,889 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,889 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,890 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:05,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-18 15:30:05,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:30:05,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:30:05,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:30:05,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:30:05,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:30:05,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:30:05,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:30:05,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:30:05,952 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 201 transitions [2019-12-18 15:30:05,954 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions [2019-12-18 15:30:06,046 INFO L126 PetriNetUnfolder]: 18/201 cut-off events. [2019-12-18 15:30:06,046 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:30:06,065 INFO L76 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs. 19/199 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2019-12-18 15:30:06,089 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions [2019-12-18 15:30:06,135 INFO L126 PetriNetUnfolder]: 18/201 cut-off events. [2019-12-18 15:30:06,135 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:30:06,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs. 19/199 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2019-12-18 15:30:06,167 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16584 [2019-12-18 15:30:06,168 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:30:08,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:09,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:10,746 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-12-18 15:30:11,202 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-18 15:30:11,330 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-18 15:30:11,518 INFO L206 etLargeBlockEncoding]: Checked pairs total: 27423 [2019-12-18 15:30:11,518 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2019-12-18 15:30:11,527 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 65 transitions [2019-12-18 15:30:11,656 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2019-12-18 15:30:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2019-12-18 15:30:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:30:11,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:11,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:11,694 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash 244665820, now seen corresponding path program 1 times [2019-12-18 15:30:11,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:11,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519226975] [2019-12-18 15:30:11,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:12,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519226975] [2019-12-18 15:30:12,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:12,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:30:12,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890546850] [2019-12-18 15:30:12,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:30:12,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:30:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:30:12,161 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 6 states. [2019-12-18 15:30:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:12,597 INFO L93 Difference]: Finished difference Result 2543 states and 8173 transitions. [2019-12-18 15:30:12,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:30:12,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 15:30:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:12,640 INFO L225 Difference]: With dead ends: 2543 [2019-12-18 15:30:12,640 INFO L226 Difference]: Without dead ends: 2405 [2019-12-18 15:30:12,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:30:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-12-18 15:30:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2019-12-18 15:30:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-12-18 15:30:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2019-12-18 15:30:12,798 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2019-12-18 15:30:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:12,798 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2019-12-18 15:30:12,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:30:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2019-12-18 15:30:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:12,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:12,802 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-18 15:30:12,803 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1321724129, now seen corresponding path program 1 times [2019-12-18 15:30:12,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:12,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217203612] [2019-12-18 15:30:12,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:13,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217203612] [2019-12-18 15:30:13,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:13,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:30:13,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603149837] [2019-12-18 15:30:13,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:30:13,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:30:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:30:13,124 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2019-12-18 15:30:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:13,685 INFO L93 Difference]: Finished difference Result 2942 states and 9516 transitions. [2019-12-18 15:30:13,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:30:13,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 15:30:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:13,708 INFO L225 Difference]: With dead ends: 2942 [2019-12-18 15:30:13,708 INFO L226 Difference]: Without dead ends: 2898 [2019-12-18 15:30:13,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:30:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-12-18 15:30:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2019-12-18 15:30:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-18 15:30:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2019-12-18 15:30:13,876 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2019-12-18 15:30:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:13,876 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2019-12-18 15:30:13,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:30:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2019-12-18 15:30:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:13,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:13,882 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-18 15:30:13,883 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 456238224, now seen corresponding path program 1 times [2019-12-18 15:30:13,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:13,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347796450] [2019-12-18 15:30:13,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:14,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347796450] [2019-12-18 15:30:14,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:14,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:14,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268874992] [2019-12-18 15:30:14,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:14,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:14,531 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 13 states. [2019-12-18 15:30:15,674 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-18 15:30:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:16,385 INFO L93 Difference]: Finished difference Result 3440 states and 11205 transitions. [2019-12-18 15:30:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:30:16,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:16,411 INFO L225 Difference]: With dead ends: 3440 [2019-12-18 15:30:16,411 INFO L226 Difference]: Without dead ends: 3440 [2019-12-18 15:30:16,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:30:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2019-12-18 15:30:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3017. [2019-12-18 15:30:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2019-12-18 15:30:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 9857 transitions. [2019-12-18 15:30:16,502 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 9857 transitions. Word has length 25 [2019-12-18 15:30:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:16,503 INFO L462 AbstractCegarLoop]: Abstraction has 3017 states and 9857 transitions. [2019-12-18 15:30:16,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 9857 transitions. [2019-12-18 15:30:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:16,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:16,510 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-18 15:30:16,511 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -556454308, now seen corresponding path program 2 times [2019-12-18 15:30:16,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:16,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350113519] [2019-12-18 15:30:16,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:17,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350113519] [2019-12-18 15:30:17,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:17,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:17,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391397980] [2019-12-18 15:30:17,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:17,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:17,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:17,074 INFO L87 Difference]: Start difference. First operand 3017 states and 9857 transitions. Second operand 13 states. [2019-12-18 15:30:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:18,960 INFO L93 Difference]: Finished difference Result 3462 states and 11280 transitions. [2019-12-18 15:30:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:30:18,963 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:18,985 INFO L225 Difference]: With dead ends: 3462 [2019-12-18 15:30:18,985 INFO L226 Difference]: Without dead ends: 3462 [2019-12-18 15:30:18,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:30:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2019-12-18 15:30:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3234. [2019-12-18 15:30:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2019-12-18 15:30:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 10616 transitions. [2019-12-18 15:30:19,135 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 10616 transitions. Word has length 25 [2019-12-18 15:30:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:19,136 INFO L462 AbstractCegarLoop]: Abstraction has 3234 states and 10616 transitions. [2019-12-18 15:30:19,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 10616 transitions. [2019-12-18 15:30:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:19,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:19,143 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-18 15:30:19,143 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -389201428, now seen corresponding path program 3 times [2019-12-18 15:30:19,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:19,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860424532] [2019-12-18 15:30:19,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:19,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860424532] [2019-12-18 15:30:19,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:19,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:19,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184747217] [2019-12-18 15:30:19,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:19,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:19,652 INFO L87 Difference]: Start difference. First operand 3234 states and 10616 transitions. Second operand 13 states. [2019-12-18 15:30:20,820 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-12-18 15:30:21,187 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-12-18 15:30:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:21,388 INFO L93 Difference]: Finished difference Result 3504 states and 11329 transitions. [2019-12-18 15:30:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:30:21,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:21,426 INFO L225 Difference]: With dead ends: 3504 [2019-12-18 15:30:21,426 INFO L226 Difference]: Without dead ends: 3504 [2019-12-18 15:30:21,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:30:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2019-12-18 15:30:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3388. [2019-12-18 15:30:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-12-18 15:30:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 11017 transitions. [2019-12-18 15:30:21,527 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 11017 transitions. Word has length 25 [2019-12-18 15:30:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:21,528 INFO L462 AbstractCegarLoop]: Abstraction has 3388 states and 11017 transitions. [2019-12-18 15:30:21,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 11017 transitions. [2019-12-18 15:30:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:21,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:21,535 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-18 15:30:21,535 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash -624413205, now seen corresponding path program 1 times [2019-12-18 15:30:21,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:21,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115627443] [2019-12-18 15:30:21,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:21,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-18 15:30:21,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115627443] [2019-12-18 15:30:22,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:22,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:22,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738358863] [2019-12-18 15:30:22,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:22,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:22,001 INFO L87 Difference]: Start difference. First operand 3388 states and 11017 transitions. Second operand 14 states. [2019-12-18 15:30:22,931 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-18 15:30:23,574 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-12-18 15:30:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:23,961 INFO L93 Difference]: Finished difference Result 4020 states and 12998 transitions. [2019-12-18 15:30:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:30:23,961 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:23,974 INFO L225 Difference]: With dead ends: 4020 [2019-12-18 15:30:23,974 INFO L226 Difference]: Without dead ends: 4020 [2019-12-18 15:30:23,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:30:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2019-12-18 15:30:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3514. [2019-12-18 15:30:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-18 15:30:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 11403 transitions. [2019-12-18 15:30:24,088 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 11403 transitions. Word has length 25 [2019-12-18 15:30:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:24,088 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 11403 transitions. [2019-12-18 15:30:24,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 11403 transitions. [2019-12-18 15:30:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:24,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:24,097 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-18 15:30:24,098 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash 106947557, now seen corresponding path program 2 times [2019-12-18 15:30:24,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:24,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794002262] [2019-12-18 15:30:24,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:24,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794002262] [2019-12-18 15:30:24,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:24,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:24,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382410624] [2019-12-18 15:30:24,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:24,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:24,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:24,772 INFO L87 Difference]: Start difference. First operand 3514 states and 11403 transitions. Second operand 14 states. [2019-12-18 15:30:26,370 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-12-18 15:30:26,648 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-18 15:30:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:27,034 INFO L93 Difference]: Finished difference Result 4056 states and 13114 transitions. [2019-12-18 15:30:27,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:30:27,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:27,047 INFO L225 Difference]: With dead ends: 4056 [2019-12-18 15:30:27,047 INFO L226 Difference]: Without dead ends: 4056 [2019-12-18 15:30:27,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:30:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-18 15:30:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3584. [2019-12-18 15:30:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-18 15:30:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11673 transitions. [2019-12-18 15:30:27,157 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11673 transitions. Word has length 25 [2019-12-18 15:30:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:27,157 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 11673 transitions. [2019-12-18 15:30:27,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11673 transitions. [2019-12-18 15:30:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:27,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:27,165 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-18 15:30:27,165 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2012965443, now seen corresponding path program 3 times [2019-12-18 15:30:27,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:27,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657771787] [2019-12-18 15:30:27,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:27,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657771787] [2019-12-18 15:30:27,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:27,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:27,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743636907] [2019-12-18 15:30:27,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:27,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:27,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:27,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:27,657 INFO L87 Difference]: Start difference. First operand 3584 states and 11673 transitions. Second operand 14 states. [2019-12-18 15:30:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:30,061 INFO L93 Difference]: Finished difference Result 4022 states and 12928 transitions. [2019-12-18 15:30:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:30:30,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:30,072 INFO L225 Difference]: With dead ends: 4022 [2019-12-18 15:30:30,073 INFO L226 Difference]: Without dead ends: 4022 [2019-12-18 15:30:30,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2019-12-18 15:30:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3794. [2019-12-18 15:30:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-12-18 15:30:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 12303 transitions. [2019-12-18 15:30:30,183 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 12303 transitions. Word has length 25 [2019-12-18 15:30:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:30,183 INFO L462 AbstractCegarLoop]: Abstraction has 3794 states and 12303 transitions. [2019-12-18 15:30:30,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 12303 transitions. [2019-12-18 15:30:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:30,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:30,191 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-18 15:30:30,192 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash 84923173, now seen corresponding path program 4 times [2019-12-18 15:30:30,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:30,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603143597] [2019-12-18 15:30:30,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:30,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603143597] [2019-12-18 15:30:30,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:30,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:30,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522882610] [2019-12-18 15:30:30,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:30,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:30,669 INFO L87 Difference]: Start difference. First operand 3794 states and 12303 transitions. Second operand 14 states. [2019-12-18 15:30:32,893 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-18 15:30:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:33,249 INFO L93 Difference]: Finished difference Result 3994 states and 12844 transitions. [2019-12-18 15:30:33,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:30:33,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:33,261 INFO L225 Difference]: With dead ends: 3994 [2019-12-18 15:30:33,262 INFO L226 Difference]: Without dead ends: 3994 [2019-12-18 15:30:33,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-12-18 15:30:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3865. [2019-12-18 15:30:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3865 states. [2019-12-18 15:30:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 12515 transitions. [2019-12-18 15:30:33,356 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 12515 transitions. Word has length 25 [2019-12-18 15:30:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:33,356 INFO L462 AbstractCegarLoop]: Abstraction has 3865 states and 12515 transitions. [2019-12-18 15:30:33,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 12515 transitions. [2019-12-18 15:30:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:33,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:33,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:33,363 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash 958663853, now seen corresponding path program 5 times [2019-12-18 15:30:33,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:33,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585922478] [2019-12-18 15:30:33,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:33,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585922478] [2019-12-18 15:30:33,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:33,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:33,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867279771] [2019-12-18 15:30:33,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:33,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:33,802 INFO L87 Difference]: Start difference. First operand 3865 states and 12515 transitions. Second operand 13 states. [2019-12-18 15:30:35,409 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 15:30:35,627 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-12-18 15:30:35,872 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-12-18 15:30:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:36,124 INFO L93 Difference]: Finished difference Result 4065 states and 13075 transitions. [2019-12-18 15:30:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:30:36,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:36,134 INFO L225 Difference]: With dead ends: 4065 [2019-12-18 15:30:36,135 INFO L226 Difference]: Without dead ends: 4065 [2019-12-18 15:30:36,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:30:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2019-12-18 15:30:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3948. [2019-12-18 15:30:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 15:30:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2019-12-18 15:30:36,225 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2019-12-18 15:30:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:36,225 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2019-12-18 15:30:36,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2019-12-18 15:30:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:36,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:36,232 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-18 15:30:36,233 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1770005220, now seen corresponding path program 4 times [2019-12-18 15:30:36,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:36,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68882220] [2019-12-18 15:30:36,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:36,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68882220] [2019-12-18 15:30:36,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:36,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:36,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13540528] [2019-12-18 15:30:36,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:36,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:36,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:36,669 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 13 states. [2019-12-18 15:30:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:38,052 INFO L93 Difference]: Finished difference Result 4050 states and 13039 transitions. [2019-12-18 15:30:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:30:38,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:38,058 INFO L225 Difference]: With dead ends: 4050 [2019-12-18 15:30:38,059 INFO L226 Difference]: Without dead ends: 4050 [2019-12-18 15:30:38,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:30:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2019-12-18 15:30:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3990. [2019-12-18 15:30:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2019-12-18 15:30:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 12909 transitions. [2019-12-18 15:30:38,143 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 12909 transitions. Word has length 25 [2019-12-18 15:30:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:38,143 INFO L462 AbstractCegarLoop]: Abstraction has 3990 states and 12909 transitions. [2019-12-18 15:30:38,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 12909 transitions. [2019-12-18 15:30:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:38,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:38,150 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-18 15:30:38,150 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash 757312688, now seen corresponding path program 5 times [2019-12-18 15:30:38,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:38,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941079698] [2019-12-18 15:30:38,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:38,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941079698] [2019-12-18 15:30:38,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:38,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:38,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042832502] [2019-12-18 15:30:38,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:38,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:38,641 INFO L87 Difference]: Start difference. First operand 3990 states and 12909 transitions. Second operand 13 states. [2019-12-18 15:30:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:40,568 INFO L93 Difference]: Finished difference Result 4358 states and 14077 transitions. [2019-12-18 15:30:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:30:40,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:40,575 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 15:30:40,575 INFO L226 Difference]: Without dead ends: 4358 [2019-12-18 15:30:40,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:30:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2019-12-18 15:30:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 4186. [2019-12-18 15:30:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2019-12-18 15:30:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 13595 transitions. [2019-12-18 15:30:40,664 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 13595 transitions. Word has length 25 [2019-12-18 15:30:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:40,664 INFO L462 AbstractCegarLoop]: Abstraction has 4186 states and 13595 transitions. [2019-12-18 15:30:40,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 13595 transitions. [2019-12-18 15:30:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:40,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:40,671 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-18 15:30:40,672 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash 924565568, now seen corresponding path program 6 times [2019-12-18 15:30:40,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:40,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934991329] [2019-12-18 15:30:40,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:41,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934991329] [2019-12-18 15:30:41,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:41,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:30:41,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193579896] [2019-12-18 15:30:41,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:30:41,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:30:41,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:30:41,049 INFO L87 Difference]: Start difference. First operand 4186 states and 13595 transitions. Second operand 12 states. [2019-12-18 15:30:43,224 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-18 15:30:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:43,563 INFO L93 Difference]: Finished difference Result 4946 states and 15775 transitions. [2019-12-18 15:30:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:43,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 15:30:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:43,570 INFO L225 Difference]: With dead ends: 4946 [2019-12-18 15:30:43,571 INFO L226 Difference]: Without dead ends: 4946 [2019-12-18 15:30:43,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:30:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2019-12-18 15:30:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 3878. [2019-12-18 15:30:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3878 states. [2019-12-18 15:30:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 12497 transitions. [2019-12-18 15:30:43,659 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 12497 transitions. Word has length 25 [2019-12-18 15:30:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:43,660 INFO L462 AbstractCegarLoop]: Abstraction has 3878 states and 12497 transitions. [2019-12-18 15:30:43,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:30:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 12497 transitions. [2019-12-18 15:30:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:43,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:43,666 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-18 15:30:43,666 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash -908781430, now seen corresponding path program 7 times [2019-12-18 15:30:43,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:43,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666538279] [2019-12-18 15:30:43,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:44,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666538279] [2019-12-18 15:30:44,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:44,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:44,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093424845] [2019-12-18 15:30:44,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:44,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:44,132 INFO L87 Difference]: Start difference. First operand 3878 states and 12497 transitions. Second operand 13 states. [2019-12-18 15:30:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:45,612 INFO L93 Difference]: Finished difference Result 3906 states and 12585 transitions. [2019-12-18 15:30:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:30:45,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:45,618 INFO L225 Difference]: With dead ends: 3906 [2019-12-18 15:30:45,618 INFO L226 Difference]: Without dead ends: 3906 [2019-12-18 15:30:45,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:30:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-12-18 15:30:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3906. [2019-12-18 15:30:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2019-12-18 15:30:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 12585 transitions. [2019-12-18 15:30:45,687 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 12585 transitions. Word has length 25 [2019-12-18 15:30:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:45,688 INFO L462 AbstractCegarLoop]: Abstraction has 3906 states and 12585 transitions. [2019-12-18 15:30:45,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 12585 transitions. [2019-12-18 15:30:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:45,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:45,695 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-18 15:30:45,695 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash -741528550, now seen corresponding path program 8 times [2019-12-18 15:30:45,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:45,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306592521] [2019-12-18 15:30:45,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:46,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306592521] [2019-12-18 15:30:46,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:46,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:46,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378996702] [2019-12-18 15:30:46,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:46,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:46,224 INFO L87 Difference]: Start difference. First operand 3906 states and 12585 transitions. Second operand 13 states. [2019-12-18 15:30:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:48,742 INFO L93 Difference]: Finished difference Result 4676 states and 14925 transitions. [2019-12-18 15:30:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:30:48,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:48,749 INFO L225 Difference]: With dead ends: 4676 [2019-12-18 15:30:48,750 INFO L226 Difference]: Without dead ends: 4676 [2019-12-18 15:30:48,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2019-12-18 15:30:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 3738. [2019-12-18 15:30:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-12-18 15:30:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 12057 transitions. [2019-12-18 15:30:48,827 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 12057 transitions. Word has length 25 [2019-12-18 15:30:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:48,828 INFO L462 AbstractCegarLoop]: Abstraction has 3738 states and 12057 transitions. [2019-12-18 15:30:48,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 12057 transitions. [2019-12-18 15:30:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:48,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:48,959 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-18 15:30:48,959 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1887146998, now seen corresponding path program 9 times [2019-12-18 15:30:48,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:48,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374112235] [2019-12-18 15:30:48,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:49,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374112235] [2019-12-18 15:30:49,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:49,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:49,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804701563] [2019-12-18 15:30:49,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:49,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:49,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:49,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:49,486 INFO L87 Difference]: Start difference. First operand 3738 states and 12057 transitions. Second operand 13 states. [2019-12-18 15:30:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:51,730 INFO L93 Difference]: Finished difference Result 4522 states and 14364 transitions. [2019-12-18 15:30:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:30:51,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 15:30:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:51,737 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 15:30:51,737 INFO L226 Difference]: Without dead ends: 4522 [2019-12-18 15:30:51,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2019-12-18 15:30:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3612. [2019-12-18 15:30:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2019-12-18 15:30:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 11584 transitions. [2019-12-18 15:30:51,810 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 11584 transitions. Word has length 25 [2019-12-18 15:30:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:51,811 INFO L462 AbstractCegarLoop]: Abstraction has 3612 states and 11584 transitions. [2019-12-18 15:30:51,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 11584 transitions. [2019-12-18 15:30:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:51,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:51,817 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-18 15:30:51,817 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 831016779, now seen corresponding path program 6 times [2019-12-18 15:30:51,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:51,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384362004] [2019-12-18 15:30:51,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:52,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384362004] [2019-12-18 15:30:52,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:52,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:52,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323486404] [2019-12-18 15:30:52,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:52,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:52,253 INFO L87 Difference]: Start difference. First operand 3612 states and 11584 transitions. Second operand 14 states. [2019-12-18 15:30:53,041 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-18 15:30:53,434 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-12-18 15:30:53,649 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-18 15:30:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:54,013 INFO L93 Difference]: Finished difference Result 3727 states and 11871 transitions. [2019-12-18 15:30:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:30:54,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:54,021 INFO L225 Difference]: With dead ends: 3727 [2019-12-18 15:30:54,021 INFO L226 Difference]: Without dead ends: 3727 [2019-12-18 15:30:54,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:30:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2019-12-18 15:30:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3661. [2019-12-18 15:30:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3661 states. [2019-12-18 15:30:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 11739 transitions. [2019-12-18 15:30:54,095 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 11739 transitions. Word has length 25 [2019-12-18 15:30:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:54,096 INFO L462 AbstractCegarLoop]: Abstraction has 3661 states and 11739 transitions. [2019-12-18 15:30:54,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 11739 transitions. [2019-12-18 15:30:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:54,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:54,101 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-18 15:30:54,101 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1562377541, now seen corresponding path program 7 times [2019-12-18 15:30:54,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:54,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445553987] [2019-12-18 15:30:54,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:54,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445553987] [2019-12-18 15:30:54,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:54,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:54,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872273369] [2019-12-18 15:30:54,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:54,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:54,497 INFO L87 Difference]: Start difference. First operand 3661 states and 11739 transitions. Second operand 14 states. [2019-12-18 15:30:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:56,190 INFO L93 Difference]: Finished difference Result 4179 states and 13299 transitions. [2019-12-18 15:30:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:30:56,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:56,197 INFO L225 Difference]: With dead ends: 4179 [2019-12-18 15:30:56,197 INFO L226 Difference]: Without dead ends: 4179 [2019-12-18 15:30:56,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:30:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2019-12-18 15:30:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3724. [2019-12-18 15:30:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2019-12-18 15:30:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 11982 transitions. [2019-12-18 15:30:56,271 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 11982 transitions. Word has length 25 [2019-12-18 15:30:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:56,271 INFO L462 AbstractCegarLoop]: Abstraction has 3724 states and 11982 transitions. [2019-12-18 15:30:56,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 11982 transitions. [2019-12-18 15:30:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:56,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:56,277 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-18 15:30:56,278 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash -557535459, now seen corresponding path program 8 times [2019-12-18 15:30:56,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:56,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484130660] [2019-12-18 15:30:56,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:56,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484130660] [2019-12-18 15:30:56,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:56,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:56,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212727972] [2019-12-18 15:30:56,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:56,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:56,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:56,888 INFO L87 Difference]: Start difference. First operand 3724 states and 11982 transitions. Second operand 14 states. [2019-12-18 15:30:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:59,437 INFO L93 Difference]: Finished difference Result 4145 states and 13127 transitions. [2019-12-18 15:30:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:59,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:30:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:59,445 INFO L225 Difference]: With dead ends: 4145 [2019-12-18 15:30:59,445 INFO L226 Difference]: Without dead ends: 4145 [2019-12-18 15:30:59,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:30:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2019-12-18 15:30:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3913. [2019-12-18 15:30:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2019-12-18 15:30:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 12549 transitions. [2019-12-18 15:30:59,502 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 12549 transitions. Word has length 25 [2019-12-18 15:30:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:59,503 INFO L462 AbstractCegarLoop]: Abstraction has 3913 states and 12549 transitions. [2019-12-18 15:30:59,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:30:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 12549 transitions. [2019-12-18 15:30:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:30:59,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:59,507 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-18 15:30:59,507 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:30:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:59,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1540353157, now seen corresponding path program 9 times [2019-12-18 15:30:59,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:59,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962782810] [2019-12-18 15:30:59,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:59,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962782810] [2019-12-18 15:30:59,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:59,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:59,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676024033] [2019-12-18 15:30:59,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:30:59,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:30:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:30:59,954 INFO L87 Difference]: Start difference. First operand 3913 states and 12549 transitions. Second operand 14 states. [2019-12-18 15:31:00,809 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-18 15:31:01,940 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-18 15:31:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:02,272 INFO L93 Difference]: Finished difference Result 4117 states and 13043 transitions. [2019-12-18 15:31:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:02,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:02,278 INFO L225 Difference]: With dead ends: 4117 [2019-12-18 15:31:02,278 INFO L226 Difference]: Without dead ends: 4117 [2019-12-18 15:31:02,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:31:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-12-18 15:31:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3976. [2019-12-18 15:31:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-12-18 15:31:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 12738 transitions. [2019-12-18 15:31:02,325 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 12738 transitions. Word has length 25 [2019-12-18 15:31:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:02,326 INFO L462 AbstractCegarLoop]: Abstraction has 3976 states and 12738 transitions. [2019-12-18 15:31:02,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 12738 transitions. [2019-12-18 15:31:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:02,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:02,330 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-18 15:31:02,331 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1880873459, now seen corresponding path program 10 times [2019-12-18 15:31:02,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:02,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595699996] [2019-12-18 15:31:02,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:02,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595699996] [2019-12-18 15:31:02,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:02,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:02,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278592869] [2019-12-18 15:31:02,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:02,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:02,875 INFO L87 Difference]: Start difference. First operand 3976 states and 12738 transitions. Second operand 14 states. [2019-12-18 15:31:05,003 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-18 15:31:05,262 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 15:31:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:05,535 INFO L93 Difference]: Finished difference Result 4726 states and 14878 transitions. [2019-12-18 15:31:05,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:31:05,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:05,541 INFO L225 Difference]: With dead ends: 4726 [2019-12-18 15:31:05,542 INFO L226 Difference]: Without dead ends: 4726 [2019-12-18 15:31:05,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:31:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-12-18 15:31:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3542. [2019-12-18 15:31:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2019-12-18 15:31:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2019-12-18 15:31:05,598 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2019-12-18 15:31:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:05,599 INFO L462 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2019-12-18 15:31:05,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2019-12-18 15:31:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:05,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:05,604 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-18 15:31:05,604 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -110028251, now seen corresponding path program 11 times [2019-12-18 15:31:05,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:05,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533381339] [2019-12-18 15:31:05,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:06,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533381339] [2019-12-18 15:31:06,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:06,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:06,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253132675] [2019-12-18 15:31:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:06,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:06,121 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 14 states. [2019-12-18 15:31:07,047 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-18 15:31:07,359 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-18 15:31:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:07,708 INFO L93 Difference]: Finished difference Result 3644 states and 11622 transitions. [2019-12-18 15:31:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:31:07,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:07,714 INFO L225 Difference]: With dead ends: 3644 [2019-12-18 15:31:07,714 INFO L226 Difference]: Without dead ends: 3644 [2019-12-18 15:31:07,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:31:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-12-18 15:31:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3584. [2019-12-18 15:31:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-18 15:31:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11502 transitions. [2019-12-18 15:31:07,757 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11502 transitions. Word has length 25 [2019-12-18 15:31:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:07,757 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 11502 transitions. [2019-12-18 15:31:07,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11502 transitions. [2019-12-18 15:31:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:07,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:07,761 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-18 15:31:07,761 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2065026045, now seen corresponding path program 12 times [2019-12-18 15:31:07,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:07,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901271060] [2019-12-18 15:31:07,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:08,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901271060] [2019-12-18 15:31:08,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:08,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:08,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270933937] [2019-12-18 15:31:08,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:08,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:08,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:08,254 INFO L87 Difference]: Start difference. First operand 3584 states and 11502 transitions. Second operand 14 states. [2019-12-18 15:31:09,957 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-18 15:31:10,190 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 15:31:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:10,625 INFO L93 Difference]: Finished difference Result 3945 states and 12527 transitions. [2019-12-18 15:31:10,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:10,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:10,636 INFO L225 Difference]: With dead ends: 3945 [2019-12-18 15:31:10,636 INFO L226 Difference]: Without dead ends: 3945 [2019-12-18 15:31:10,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2019-12-18 15:31:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3773. [2019-12-18 15:31:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3773 states. [2019-12-18 15:31:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 12069 transitions. [2019-12-18 15:31:10,727 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 12069 transitions. Word has length 25 [2019-12-18 15:31:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:10,727 INFO L462 AbstractCegarLoop]: Abstraction has 3773 states and 12069 transitions. [2019-12-18 15:31:10,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 12069 transitions. [2019-12-18 15:31:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:10,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:10,733 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-18 15:31:10,733 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -132052635, now seen corresponding path program 13 times [2019-12-18 15:31:10,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:10,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613407906] [2019-12-18 15:31:10,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:11,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613407906] [2019-12-18 15:31:11,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:11,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:11,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9945259] [2019-12-18 15:31:11,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:11,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:11,156 INFO L87 Difference]: Start difference. First operand 3773 states and 12069 transitions. Second operand 14 states. [2019-12-18 15:31:13,117 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-18 15:31:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:13,479 INFO L93 Difference]: Finished difference Result 3917 states and 12443 transitions. [2019-12-18 15:31:13,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:13,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:13,485 INFO L225 Difference]: With dead ends: 3917 [2019-12-18 15:31:13,485 INFO L226 Difference]: Without dead ends: 3917 [2019-12-18 15:31:13,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2019-12-18 15:31:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3836. [2019-12-18 15:31:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-12-18 15:31:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12258 transitions. [2019-12-18 15:31:13,531 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12258 transitions. Word has length 25 [2019-12-18 15:31:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:13,532 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 12258 transitions. [2019-12-18 15:31:13,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12258 transitions. [2019-12-18 15:31:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:13,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:13,535 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-18 15:31:13,536 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 741688045, now seen corresponding path program 14 times [2019-12-18 15:31:13,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:13,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338606362] [2019-12-18 15:31:13,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:14,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338606362] [2019-12-18 15:31:14,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:14,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:14,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788516023] [2019-12-18 15:31:14,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:14,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:14,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:14,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:14,127 INFO L87 Difference]: Start difference. First operand 3836 states and 12258 transitions. Second operand 14 states. [2019-12-18 15:31:16,606 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 15:31:16,873 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 15:31:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:17,188 INFO L93 Difference]: Finished difference Result 4526 states and 14278 transitions. [2019-12-18 15:31:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:31:17,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:17,195 INFO L225 Difference]: With dead ends: 4526 [2019-12-18 15:31:17,195 INFO L226 Difference]: Without dead ends: 4526 [2019-12-18 15:31:17,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:31:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-12-18 15:31:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3472. [2019-12-18 15:31:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-12-18 15:31:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 11104 transitions. [2019-12-18 15:31:17,248 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 11104 transitions. Word has length 25 [2019-12-18 15:31:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:17,249 INFO L462 AbstractCegarLoop]: Abstraction has 3472 states and 11104 transitions. [2019-12-18 15:31:17,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 11104 transitions. [2019-12-18 15:31:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:17,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:17,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] [2019-12-18 15:31:17,252 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1027185563, now seen corresponding path program 15 times [2019-12-18 15:31:17,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:17,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379841961] [2019-12-18 15:31:17,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:17,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379841961] [2019-12-18 15:31:17,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:17,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849322670] [2019-12-18 15:31:17,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:17,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:17,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:17,774 INFO L87 Difference]: Start difference. First operand 3472 states and 11104 transitions. Second operand 14 states. [2019-12-18 15:31:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:19,515 INFO L93 Difference]: Finished difference Result 3570 states and 11323 transitions. [2019-12-18 15:31:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:31:19,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:19,521 INFO L225 Difference]: With dead ends: 3570 [2019-12-18 15:31:19,521 INFO L226 Difference]: Without dead ends: 3570 [2019-12-18 15:31:19,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:31:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-12-18 15:31:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3570. [2019-12-18 15:31:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2019-12-18 15:31:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 11323 transitions. [2019-12-18 15:31:19,565 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 11323 transitions. Word has length 25 [2019-12-18 15:31:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:19,565 INFO L462 AbstractCegarLoop]: Abstraction has 3570 states and 11323 transitions. [2019-12-18 15:31:19,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 11323 transitions. [2019-12-18 15:31:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:19,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:19,568 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-18 15:31:19,569 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash -5811913, now seen corresponding path program 16 times [2019-12-18 15:31:19,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:19,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042655054] [2019-12-18 15:31:19,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:20,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042655054] [2019-12-18 15:31:20,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:20,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:20,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39353056] [2019-12-18 15:31:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:20,046 INFO L87 Difference]: Start difference. First operand 3570 states and 11323 transitions. Second operand 14 states. [2019-12-18 15:31:21,949 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 15:31:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:22,282 INFO L93 Difference]: Finished difference Result 3591 states and 11388 transitions. [2019-12-18 15:31:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:31:22,283 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:22,290 INFO L225 Difference]: With dead ends: 3591 [2019-12-18 15:31:22,290 INFO L226 Difference]: Without dead ends: 3591 [2019-12-18 15:31:22,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:31:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2019-12-18 15:31:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3493. [2019-12-18 15:31:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2019-12-18 15:31:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 11092 transitions. [2019-12-18 15:31:22,348 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 11092 transitions. Word has length 25 [2019-12-18 15:31:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:22,349 INFO L462 AbstractCegarLoop]: Abstraction has 3493 states and 11092 transitions. [2019-12-18 15:31:22,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 11092 transitions. [2019-12-18 15:31:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:22,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:22,353 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-18 15:31:22,353 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1070703053, now seen corresponding path program 17 times [2019-12-18 15:31:22,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:22,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011473070] [2019-12-18 15:31:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:22,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011473070] [2019-12-18 15:31:22,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:22,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:22,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592128059] [2019-12-18 15:31:22,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:22,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:22,833 INFO L87 Difference]: Start difference. First operand 3493 states and 11092 transitions. Second operand 14 states. [2019-12-18 15:31:25,120 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 15:31:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:25,529 INFO L93 Difference]: Finished difference Result 3577 states and 11346 transitions. [2019-12-18 15:31:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:25,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:25,535 INFO L225 Difference]: With dead ends: 3577 [2019-12-18 15:31:25,535 INFO L226 Difference]: Without dead ends: 3577 [2019-12-18 15:31:25,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2019-12-18 15:31:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3556. [2019-12-18 15:31:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-12-18 15:31:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 11281 transitions. [2019-12-18 15:31:25,577 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 11281 transitions. Word has length 25 [2019-12-18 15:31:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:25,577 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 11281 transitions. [2019-12-18 15:31:25,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 11281 transitions. [2019-12-18 15:31:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:25,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:25,581 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-18 15:31:25,581 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:25,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443733, now seen corresponding path program 18 times [2019-12-18 15:31:25,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:25,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915969281] [2019-12-18 15:31:25,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:26,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915969281] [2019-12-18 15:31:26,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:26,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:26,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903401961] [2019-12-18 15:31:26,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:26,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:26,043 INFO L87 Difference]: Start difference. First operand 3556 states and 11281 transitions. Second operand 14 states. [2019-12-18 15:31:29,341 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-18 15:31:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:29,684 INFO L93 Difference]: Finished difference Result 4186 states and 13181 transitions. [2019-12-18 15:31:29,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:31:29,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:29,690 INFO L225 Difference]: With dead ends: 4186 [2019-12-18 15:31:29,690 INFO L226 Difference]: Without dead ends: 4186 [2019-12-18 15:31:29,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=345, Invalid=777, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:31:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2019-12-18 15:31:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3262. [2019-12-18 15:31:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-12-18 15:31:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 10397 transitions. [2019-12-18 15:31:29,743 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 10397 transitions. Word has length 25 [2019-12-18 15:31:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:29,744 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 10397 transitions. [2019-12-18 15:31:29,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 10397 transitions. [2019-12-18 15:31:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:29,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:29,747 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-18 15:31:29,747 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 137738405, now seen corresponding path program 19 times [2019-12-18 15:31:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:29,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135768460] [2019-12-18 15:31:29,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135768460] [2019-12-18 15:31:30,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:30,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:30,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620887459] [2019-12-18 15:31:30,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:30,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:30,229 INFO L87 Difference]: Start difference. First operand 3262 states and 10397 transitions. Second operand 14 states. [2019-12-18 15:31:31,662 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 15:31:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:31,952 INFO L93 Difference]: Finished difference Result 3276 states and 10441 transitions. [2019-12-18 15:31:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:31:31,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:31,959 INFO L225 Difference]: With dead ends: 3276 [2019-12-18 15:31:31,959 INFO L226 Difference]: Without dead ends: 3276 [2019-12-18 15:31:31,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:31:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-12-18 15:31:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2019-12-18 15:31:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-12-18 15:31:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 10441 transitions. [2019-12-18 15:31:32,003 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 10441 transitions. Word has length 25 [2019-12-18 15:31:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:32,004 INFO L462 AbstractCegarLoop]: Abstraction has 3276 states and 10441 transitions. [2019-12-18 15:31:32,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 10441 transitions. [2019-12-18 15:31:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:32,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:32,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:32,006 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1011479085, now seen corresponding path program 20 times [2019-12-18 15:31:32,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:32,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341583765] [2019-12-18 15:31:32,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:32,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341583765] [2019-12-18 15:31:32,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:32,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:32,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785232772] [2019-12-18 15:31:32,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:31:32,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:31:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:31:32,509 INFO L87 Difference]: Start difference. First operand 3276 states and 10441 transitions. Second operand 14 states. [2019-12-18 15:31:35,478 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 15:31:35,724 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-12-18 15:31:35,882 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 15:31:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:36,263 INFO L93 Difference]: Finished difference Result 4060 states and 12825 transitions. [2019-12-18 15:31:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 15:31:36,263 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 15:31:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:36,269 INFO L225 Difference]: With dead ends: 4060 [2019-12-18 15:31:36,270 INFO L226 Difference]: Without dead ends: 4060 [2019-12-18 15:31:36,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:31:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2019-12-18 15:31:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3206. [2019-12-18 15:31:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2019-12-18 15:31:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 10231 transitions. [2019-12-18 15:31:36,320 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 10231 transitions. Word has length 25 [2019-12-18 15:31:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:36,320 INFO L462 AbstractCegarLoop]: Abstraction has 3206 states and 10231 transitions. [2019-12-18 15:31:36,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:31:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 10231 transitions. [2019-12-18 15:31:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:36,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:36,323 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-18 15:31:36,324 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1573876017, now seen corresponding path program 1 times [2019-12-18 15:31:36,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:36,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810490691] [2019-12-18 15:31:36,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:37,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810490691] [2019-12-18 15:31:37,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:37,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:37,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108227854] [2019-12-18 15:31:37,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:37,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:37,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:37,078 INFO L87 Difference]: Start difference. First operand 3206 states and 10231 transitions. Second operand 16 states. [2019-12-18 15:31:38,170 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-18 15:31:38,352 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-18 15:31:38,587 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-12-18 15:31:38,771 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 15:31:38,982 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-18 15:31:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:40,123 INFO L93 Difference]: Finished difference Result 5231 states and 16874 transitions. [2019-12-18 15:31:40,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:40,124 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:40,131 INFO L225 Difference]: With dead ends: 5231 [2019-12-18 15:31:40,131 INFO L226 Difference]: Without dead ends: 5231 [2019-12-18 15:31:40,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2019-12-18 15:31:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3768. [2019-12-18 15:31:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2019-12-18 15:31:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12142 transitions. [2019-12-18 15:31:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12142 transitions. Word has length 27 [2019-12-18 15:31:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:40,185 INFO L462 AbstractCegarLoop]: Abstraction has 3768 states and 12142 transitions. [2019-12-18 15:31:40,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12142 transitions. [2019-12-18 15:31:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:40,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:40,187 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-18 15:31:40,187 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:40,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1573876023, now seen corresponding path program 1 times [2019-12-18 15:31:40,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:40,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543766443] [2019-12-18 15:31:40,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:40,817 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2019-12-18 15:31:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:41,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543766443] [2019-12-18 15:31:41,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:41,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:41,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741599970] [2019-12-18 15:31:41,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:41,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:41,037 INFO L87 Difference]: Start difference. First operand 3768 states and 12142 transitions. Second operand 16 states. [2019-12-18 15:31:42,294 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 15:31:42,481 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-18 15:31:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:43,263 INFO L93 Difference]: Finished difference Result 5138 states and 16527 transitions. [2019-12-18 15:31:43,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:43,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:43,272 INFO L225 Difference]: With dead ends: 5138 [2019-12-18 15:31:43,272 INFO L226 Difference]: Without dead ends: 5138 [2019-12-18 15:31:43,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2019-12-18 15:31:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3768. [2019-12-18 15:31:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2019-12-18 15:31:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12049 transitions. [2019-12-18 15:31:43,359 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12049 transitions. Word has length 27 [2019-12-18 15:31:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:43,360 INFO L462 AbstractCegarLoop]: Abstraction has 3768 states and 12049 transitions. [2019-12-18 15:31:43,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12049 transitions. [2019-12-18 15:31:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:43,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:43,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:43,363 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 186176923, now seen corresponding path program 2 times [2019-12-18 15:31:43,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:43,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136236570] [2019-12-18 15:31:43,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:43,897 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2019-12-18 15:31:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:44,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136236570] [2019-12-18 15:31:44,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:44,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:44,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235738941] [2019-12-18 15:31:44,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:44,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:44,109 INFO L87 Difference]: Start difference. First operand 3768 states and 12049 transitions. Second operand 16 states. [2019-12-18 15:31:45,484 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-18 15:31:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:46,699 INFO L93 Difference]: Finished difference Result 6291 states and 20340 transitions. [2019-12-18 15:31:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:46,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:46,708 INFO L225 Difference]: With dead ends: 6291 [2019-12-18 15:31:46,709 INFO L226 Difference]: Without dead ends: 6291 [2019-12-18 15:31:46,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2019-12-18 15:31:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 4456. [2019-12-18 15:31:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2019-12-18 15:31:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 14338 transitions. [2019-12-18 15:31:46,774 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 14338 transitions. Word has length 27 [2019-12-18 15:31:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:46,774 INFO L462 AbstractCegarLoop]: Abstraction has 4456 states and 14338 transitions. [2019-12-18 15:31:46,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 14338 transitions. [2019-12-18 15:31:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:46,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:46,778 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-18 15:31:46,778 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash 186176917, now seen corresponding path program 2 times [2019-12-18 15:31:46,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:46,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176294112] [2019-12-18 15:31:46,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:47,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176294112] [2019-12-18 15:31:47,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:47,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:31:47,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845475520] [2019-12-18 15:31:47,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:31:47,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:31:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:31:47,580 INFO L87 Difference]: Start difference. First operand 4456 states and 14338 transitions. Second operand 16 states. [2019-12-18 15:31:48,518 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-12-18 15:31:48,962 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-12-18 15:31:49,130 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-18 15:31:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:50,005 INFO L93 Difference]: Finished difference Result 5769 states and 18546 transitions. [2019-12-18 15:31:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:31:50,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:31:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:50,014 INFO L225 Difference]: With dead ends: 5769 [2019-12-18 15:31:50,014 INFO L226 Difference]: Without dead ends: 5769 [2019-12-18 15:31:50,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:31:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-12-18 15:31:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 3978. [2019-12-18 15:31:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-18 15:31:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 12679 transitions. [2019-12-18 15:31:50,074 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 12679 transitions. Word has length 27 [2019-12-18 15:31:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:50,074 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 12679 transitions. [2019-12-18 15:31:50,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:31:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 12679 transitions. [2019-12-18 15:31:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:50,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:50,077 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-18 15:31:50,078 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1641843469, now seen corresponding path program 3 times [2019-12-18 15:31:50,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:50,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332542136] [2019-12-18 15:31:50,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:50,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332542136] [2019-12-18 15:31:50,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:50,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:50,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784751271] [2019-12-18 15:31:50,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:50,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:50,707 INFO L87 Difference]: Start difference. First operand 3978 states and 12679 transitions. Second operand 15 states. [2019-12-18 15:31:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:53,302 INFO L93 Difference]: Finished difference Result 6136 states and 19924 transitions. [2019-12-18 15:31:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:53,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:31:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:53,312 INFO L225 Difference]: With dead ends: 6136 [2019-12-18 15:31:53,312 INFO L226 Difference]: Without dead ends: 6136 [2019-12-18 15:31:53,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2019-12-18 15:31:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 4998. [2019-12-18 15:31:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 15:31:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 16068 transitions. [2019-12-18 15:31:53,385 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 16068 transitions. Word has length 27 [2019-12-18 15:31:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 16068 transitions. [2019-12-18 15:31:53,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:31:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 16068 transitions. [2019-12-18 15:31:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:53,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:53,389 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-18 15:31:53,390 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1641843463, now seen corresponding path program 3 times [2019-12-18 15:31:53,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:53,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159851071] [2019-12-18 15:31:53,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:53,863 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2019-12-18 15:31:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:54,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159851071] [2019-12-18 15:31:54,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:54,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:31:54,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433797773] [2019-12-18 15:31:54,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:31:54,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:31:54,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:31:54,102 INFO L87 Difference]: Start difference. First operand 4998 states and 16068 transitions. Second operand 15 states. [2019-12-18 15:31:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:56,448 INFO L93 Difference]: Finished difference Result 6136 states and 19779 transitions. [2019-12-18 15:31:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:31:56,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:31:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:56,457 INFO L225 Difference]: With dead ends: 6136 [2019-12-18 15:31:56,457 INFO L226 Difference]: Without dead ends: 6136 [2019-12-18 15:31:56,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:31:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2019-12-18 15:31:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 4506. [2019-12-18 15:31:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-12-18 15:31:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14367 transitions. [2019-12-18 15:31:56,521 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14367 transitions. Word has length 27 [2019-12-18 15:31:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:56,521 INFO L462 AbstractCegarLoop]: Abstraction has 4506 states and 14367 transitions. [2019-12-18 15:31:56,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:31:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14367 transitions. [2019-12-18 15:31:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:31:56,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:56,525 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-18 15:31:56,525 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:31:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash 707987975, now seen corresponding path program 1 times [2019-12-18 15:31:56,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:56,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622154038] [2019-12-18 15:31:56,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:57,142 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-12-18 15:31:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:57,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622154038] [2019-12-18 15:31:57,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:31:57,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:31:57,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851236634] [2019-12-18 15:31:57,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:31:57,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:31:57,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:31:57,367 INFO L87 Difference]: Start difference. First operand 4506 states and 14367 transitions. Second operand 17 states. [2019-12-18 15:31:58,584 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 15:31:58,780 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-18 15:31:59,103 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-18 15:32:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:00,638 INFO L93 Difference]: Finished difference Result 6526 states and 21072 transitions. [2019-12-18 15:32:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:00,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:32:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:00,647 INFO L225 Difference]: With dead ends: 6526 [2019-12-18 15:32:00,648 INFO L226 Difference]: Without dead ends: 6526 [2019-12-18 15:32:00,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:32:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2019-12-18 15:32:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 5060. [2019-12-18 15:32:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2019-12-18 15:32:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16254 transitions. [2019-12-18 15:32:00,716 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16254 transitions. Word has length 27 [2019-12-18 15:32:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 5060 states and 16254 transitions. [2019-12-18 15:32:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:32:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16254 transitions. [2019-12-18 15:32:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:00,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:00,720 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-18 15:32:00,720 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash 707987969, now seen corresponding path program 1 times [2019-12-18 15:32:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:00,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406494194] [2019-12-18 15:32:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:01,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406494194] [2019-12-18 15:32:01,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:01,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:32:01,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221265842] [2019-12-18 15:32:01,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:32:01,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:01,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:32:01,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:32:01,507 INFO L87 Difference]: Start difference. First operand 5060 states and 16254 transitions. Second operand 17 states. [2019-12-18 15:32:02,503 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 15:32:02,673 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-18 15:32:02,918 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 15:32:03,112 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 15:32:03,338 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-18 15:32:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:04,482 INFO L93 Difference]: Finished difference Result 6526 states and 20927 transitions. [2019-12-18 15:32:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:04,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:32:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:04,491 INFO L225 Difference]: With dead ends: 6526 [2019-12-18 15:32:04,492 INFO L226 Difference]: Without dead ends: 6526 [2019-12-18 15:32:04,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:32:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2019-12-18 15:32:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 4736. [2019-12-18 15:32:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2019-12-18 15:32:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 15084 transitions. [2019-12-18 15:32:04,556 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 15084 transitions. Word has length 27 [2019-12-18 15:32:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:04,556 INFO L462 AbstractCegarLoop]: Abstraction has 4736 states and 15084 transitions. [2019-12-18 15:32:04,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:32:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 15084 transitions. [2019-12-18 15:32:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:04,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:04,560 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-18 15:32:04,560 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -828956287, now seen corresponding path program 2 times [2019-12-18 15:32:04,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:04,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622112908] [2019-12-18 15:32:04,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:05,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622112908] [2019-12-18 15:32:05,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:05,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:32:05,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887231018] [2019-12-18 15:32:05,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:32:05,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:32:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:32:05,321 INFO L87 Difference]: Start difference. First operand 4736 states and 15084 transitions. Second operand 17 states. [2019-12-18 15:32:06,507 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-12-18 15:32:06,706 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-12-18 15:32:07,061 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-12-18 15:32:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:08,087 INFO L93 Difference]: Finished difference Result 7234 states and 23377 transitions. [2019-12-18 15:32:08,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:08,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:32:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:08,097 INFO L225 Difference]: With dead ends: 7234 [2019-12-18 15:32:08,098 INFO L226 Difference]: Without dead ends: 7234 [2019-12-18 15:32:08,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:32:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2019-12-18 15:32:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 5278. [2019-12-18 15:32:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5278 states. [2019-12-18 15:32:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 16935 transitions. [2019-12-18 15:32:08,172 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 16935 transitions. Word has length 27 [2019-12-18 15:32:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:08,173 INFO L462 AbstractCegarLoop]: Abstraction has 5278 states and 16935 transitions. [2019-12-18 15:32:08,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:32:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 16935 transitions. [2019-12-18 15:32:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:08,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:08,177 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-18 15:32:08,177 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash -828956293, now seen corresponding path program 2 times [2019-12-18 15:32:08,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:08,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346198118] [2019-12-18 15:32:08,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:08,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346198118] [2019-12-18 15:32:08,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:08,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:32:08,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323115682] [2019-12-18 15:32:08,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:32:08,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:32:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:32:08,965 INFO L87 Difference]: Start difference. First operand 5278 states and 16935 transitions. Second operand 17 states. [2019-12-18 15:32:10,259 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-12-18 15:32:10,424 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-18 15:32:10,653 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-18 15:32:10,840 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-12-18 15:32:11,057 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-18 15:32:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:12,284 INFO L93 Difference]: Finished difference Result 6805 states and 21785 transitions. [2019-12-18 15:32:12,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:12,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:32:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:12,294 INFO L225 Difference]: With dead ends: 6805 [2019-12-18 15:32:12,295 INFO L226 Difference]: Without dead ends: 6805 [2019-12-18 15:32:12,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:32:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2019-12-18 15:32:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 4796. [2019-12-18 15:32:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4796 states. [2019-12-18 15:32:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 15264 transitions. [2019-12-18 15:32:12,363 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 15264 transitions. Word has length 27 [2019-12-18 15:32:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:12,363 INFO L462 AbstractCegarLoop]: Abstraction has 4796 states and 15264 transitions. [2019-12-18 15:32:12,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:32:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 15264 transitions. [2019-12-18 15:32:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:12,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:12,368 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-18 15:32:12,368 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116313, now seen corresponding path program 3 times [2019-12-18 15:32:12,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:12,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116937738] [2019-12-18 15:32:12,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:13,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116937738] [2019-12-18 15:32:13,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:13,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:13,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091778824] [2019-12-18 15:32:13,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:13,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:13,064 INFO L87 Difference]: Start difference. First operand 4796 states and 15264 transitions. Second operand 16 states. [2019-12-18 15:32:14,548 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-12-18 15:32:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:16,134 INFO L93 Difference]: Finished difference Result 7448 states and 24096 transitions. [2019-12-18 15:32:16,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:16,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:16,145 INFO L225 Difference]: With dead ends: 7448 [2019-12-18 15:32:16,145 INFO L226 Difference]: Without dead ends: 7448 [2019-12-18 15:32:16,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2019-12-18 15:32:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5986. [2019-12-18 15:32:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2019-12-18 15:32:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 19163 transitions. [2019-12-18 15:32:16,226 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 19163 transitions. Word has length 27 [2019-12-18 15:32:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:16,227 INFO L462 AbstractCegarLoop]: Abstraction has 5986 states and 19163 transitions. [2019-12-18 15:32:16,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 19163 transitions. [2019-12-18 15:32:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:16,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:16,232 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-18 15:32:16,232 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116307, now seen corresponding path program 3 times [2019-12-18 15:32:16,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:16,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028703841] [2019-12-18 15:32:16,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:16,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028703841] [2019-12-18 15:32:16,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:16,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:16,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831859821] [2019-12-18 15:32:16,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:16,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:16,916 INFO L87 Difference]: Start difference. First operand 5986 states and 19163 transitions. Second operand 16 states. [2019-12-18 15:32:17,661 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-12-18 15:32:18,018 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 15:32:18,275 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-12-18 15:32:18,556 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 15:32:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:20,143 INFO L93 Difference]: Finished difference Result 7019 states and 22504 transitions. [2019-12-18 15:32:20,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:20,143 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:20,153 INFO L225 Difference]: With dead ends: 7019 [2019-12-18 15:32:20,153 INFO L226 Difference]: Without dead ends: 7019 [2019-12-18 15:32:20,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7019 states. [2019-12-18 15:32:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7019 to 5180. [2019-12-18 15:32:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-12-18 15:32:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 16448 transitions. [2019-12-18 15:32:20,235 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 16448 transitions. Word has length 27 [2019-12-18 15:32:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:20,235 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 16448 transitions. [2019-12-18 15:32:20,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 16448 transitions. [2019-12-18 15:32:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:20,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:20,241 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-18 15:32:20,242 INFO L410 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:20,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1764177885, now seen corresponding path program 4 times [2019-12-18 15:32:20,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:20,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440189875] [2019-12-18 15:32:20,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:20,887 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 38 [2019-12-18 15:32:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:21,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440189875] [2019-12-18 15:32:21,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:21,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:21,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001121565] [2019-12-18 15:32:21,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:21,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:21,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:21,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:21,132 INFO L87 Difference]: Start difference. First operand 5180 states and 16448 transitions. Second operand 16 states. [2019-12-18 15:32:22,576 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-18 15:32:22,781 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 15:32:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:23,873 INFO L93 Difference]: Finished difference Result 6661 states and 21391 transitions. [2019-12-18 15:32:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:23,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:23,884 INFO L225 Difference]: With dead ends: 6661 [2019-12-18 15:32:23,884 INFO L226 Difference]: Without dead ends: 6661 [2019-12-18 15:32:23,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-12-18 15:32:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5107. [2019-12-18 15:32:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-18 15:32:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 16229 transitions. [2019-12-18 15:32:23,956 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 16229 transitions. Word has length 27 [2019-12-18 15:32:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:23,957 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 16229 transitions. [2019-12-18 15:32:23,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 16229 transitions. [2019-12-18 15:32:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:23,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:23,961 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-18 15:32:23,961 INFO L410 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -4124945, now seen corresponding path program 5 times [2019-12-18 15:32:23,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:23,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700399431] [2019-12-18 15:32:23,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:24,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700399431] [2019-12-18 15:32:24,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:24,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:24,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789639390] [2019-12-18 15:32:24,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:24,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:24,740 INFO L87 Difference]: Start difference. First operand 5107 states and 16229 transitions. Second operand 16 states. [2019-12-18 15:32:26,324 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-12-18 15:32:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:27,673 INFO L93 Difference]: Finished difference Result 7579 states and 24444 transitions. [2019-12-18 15:32:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:27,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:27,684 INFO L225 Difference]: With dead ends: 7579 [2019-12-18 15:32:27,684 INFO L226 Difference]: Without dead ends: 7579 [2019-12-18 15:32:27,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2019-12-18 15:32:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 5774. [2019-12-18 15:32:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5774 states. [2019-12-18 15:32:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5774 states to 5774 states and 18455 transitions. [2019-12-18 15:32:27,762 INFO L78 Accepts]: Start accepts. Automaton has 5774 states and 18455 transitions. Word has length 27 [2019-12-18 15:32:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:27,763 INFO L462 AbstractCegarLoop]: Abstraction has 5774 states and 18455 transitions. [2019-12-18 15:32:27,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states and 18455 transitions. [2019-12-18 15:32:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:27,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:27,769 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-18 15:32:27,769 INFO L410 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash -4124951, now seen corresponding path program 4 times [2019-12-18 15:32:27,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:27,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505407392] [2019-12-18 15:32:27,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:28,346 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-12-18 15:32:28,640 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-12-18 15:32:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:28,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505407392] [2019-12-18 15:32:28,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:28,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:28,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872607543] [2019-12-18 15:32:28,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:28,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:28,958 INFO L87 Difference]: Start difference. First operand 5774 states and 18455 transitions. Second operand 16 states. [2019-12-18 15:32:30,638 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 15:32:30,837 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 15:32:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:32,021 INFO L93 Difference]: Finished difference Result 7150 states and 22852 transitions. [2019-12-18 15:32:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:32:32,021 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:32,031 INFO L225 Difference]: With dead ends: 7150 [2019-12-18 15:32:32,032 INFO L226 Difference]: Without dead ends: 7150 [2019-12-18 15:32:32,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:32:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2019-12-18 15:32:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 5296. [2019-12-18 15:32:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-12-18 15:32:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 16796 transitions. [2019-12-18 15:32:32,108 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 16796 transitions. Word has length 27 [2019-12-18 15:32:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:32,108 INFO L462 AbstractCegarLoop]: Abstraction has 5296 states and 16796 transitions. [2019-12-18 15:32:32,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 16796 transitions. [2019-12-18 15:32:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:32,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:32,112 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-18 15:32:32,112 INFO L410 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1451541601, now seen corresponding path program 6 times [2019-12-18 15:32:32,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:32,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086310483] [2019-12-18 15:32:32,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:32,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086310483] [2019-12-18 15:32:32,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:32,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:32,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228794114] [2019-12-18 15:32:32,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:32,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:32,774 INFO L87 Difference]: Start difference. First operand 5296 states and 16796 transitions. Second operand 15 states. [2019-12-18 15:32:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:35,225 INFO L93 Difference]: Finished difference Result 7946 states and 25649 transitions. [2019-12-18 15:32:35,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:32:35,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:35,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:35,238 INFO L225 Difference]: With dead ends: 7946 [2019-12-18 15:32:35,238 INFO L226 Difference]: Without dead ends: 7946 [2019-12-18 15:32:35,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:32:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2019-12-18 15:32:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 6316. [2019-12-18 15:32:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-12-18 15:32:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 20185 transitions. [2019-12-18 15:32:35,346 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 20185 transitions. Word has length 27 [2019-12-18 15:32:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:35,346 INFO L462 AbstractCegarLoop]: Abstraction has 6316 states and 20185 transitions. [2019-12-18 15:32:35,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 20185 transitions. [2019-12-18 15:32:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:35,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:35,351 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-18 15:32:35,351 INFO L410 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:35,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1451541595, now seen corresponding path program 5 times [2019-12-18 15:32:35,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:35,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402855785] [2019-12-18 15:32:35,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:35,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402855785] [2019-12-18 15:32:35,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:35,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:35,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480005372] [2019-12-18 15:32:35,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:35,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:35,921 INFO L87 Difference]: Start difference. First operand 6316 states and 20185 transitions. Second operand 15 states. [2019-12-18 15:32:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:38,636 INFO L93 Difference]: Finished difference Result 7946 states and 25504 transitions. [2019-12-18 15:32:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:32:38,638 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:38,651 INFO L225 Difference]: With dead ends: 7946 [2019-12-18 15:32:38,651 INFO L226 Difference]: Without dead ends: 7946 [2019-12-18 15:32:38,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:32:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2019-12-18 15:32:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 5044. [2019-12-18 15:32:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2019-12-18 15:32:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 16040 transitions. [2019-12-18 15:32:38,723 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 16040 transitions. Word has length 27 [2019-12-18 15:32:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:38,724 INFO L462 AbstractCegarLoop]: Abstraction has 5044 states and 16040 transitions. [2019-12-18 15:32:38,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 16040 transitions. [2019-12-18 15:32:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:38,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:38,728 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-18 15:32:38,728 INFO L410 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash 902229065, now seen corresponding path program 7 times [2019-12-18 15:32:38,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:38,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362754429] [2019-12-18 15:32:38,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:39,298 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2019-12-18 15:32:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:39,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362754429] [2019-12-18 15:32:39,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:39,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:39,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262158282] [2019-12-18 15:32:39,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:39,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:39,520 INFO L87 Difference]: Start difference. First operand 5044 states and 16040 transitions. Second operand 16 states. [2019-12-18 15:32:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:42,569 INFO L93 Difference]: Finished difference Result 6556 states and 21221 transitions. [2019-12-18 15:32:42,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:42,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:42,580 INFO L225 Difference]: With dead ends: 6556 [2019-12-18 15:32:42,580 INFO L226 Difference]: Without dead ends: 6556 [2019-12-18 15:32:42,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6556 states. [2019-12-18 15:32:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6556 to 5501. [2019-12-18 15:32:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5501 states. [2019-12-18 15:32:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5501 states to 5501 states and 17636 transitions. [2019-12-18 15:32:42,657 INFO L78 Accepts]: Start accepts. Automaton has 5501 states and 17636 transitions. Word has length 27 [2019-12-18 15:32:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:42,657 INFO L462 AbstractCegarLoop]: Abstraction has 5501 states and 17636 transitions. [2019-12-18 15:32:42,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5501 states and 17636 transitions. [2019-12-18 15:32:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:42,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:42,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:42,663 INFO L410 AbstractCegarLoop]: === Iteration 50 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash 902229059, now seen corresponding path program 6 times [2019-12-18 15:32:42,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:42,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321784529] [2019-12-18 15:32:42,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:43,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321784529] [2019-12-18 15:32:43,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:43,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:32:43,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289685484] [2019-12-18 15:32:43,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:32:43,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:43,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:32:43,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:32:43,444 INFO L87 Difference]: Start difference. First operand 5501 states and 17636 transitions. Second operand 16 states. [2019-12-18 15:32:44,448 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-18 15:32:44,897 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 15:32:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:46,038 INFO L93 Difference]: Finished difference Result 6127 states and 19629 transitions. [2019-12-18 15:32:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:32:46,038 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:32:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:46,047 INFO L225 Difference]: With dead ends: 6127 [2019-12-18 15:32:46,047 INFO L226 Difference]: Without dead ends: 6127 [2019-12-18 15:32:46,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-12-18 15:32:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5023. [2019-12-18 15:32:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-12-18 15:32:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 15977 transitions. [2019-12-18 15:32:46,112 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 15977 transitions. Word has length 27 [2019-12-18 15:32:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:46,112 INFO L462 AbstractCegarLoop]: Abstraction has 5023 states and 15977 transitions. [2019-12-18 15:32:46,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:32:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 15977 transitions. [2019-12-18 15:32:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:46,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:46,116 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-18 15:32:46,116 INFO L410 AbstractCegarLoop]: === Iteration 51 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1937071685, now seen corresponding path program 8 times [2019-12-18 15:32:46,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:46,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655694674] [2019-12-18 15:32:46,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:46,551 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 31 [2019-12-18 15:32:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:46,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655694674] [2019-12-18 15:32:46,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:46,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:46,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621962803] [2019-12-18 15:32:46,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:46,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:46,730 INFO L87 Difference]: Start difference. First operand 5023 states and 15977 transitions. Second operand 15 states. [2019-12-18 15:32:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:49,294 INFO L93 Difference]: Finished difference Result 7736 states and 24874 transitions. [2019-12-18 15:32:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:32:49,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:49,306 INFO L225 Difference]: With dead ends: 7736 [2019-12-18 15:32:49,306 INFO L226 Difference]: Without dead ends: 7736 [2019-12-18 15:32:49,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:32:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7736 states. [2019-12-18 15:32:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7736 to 4834. [2019-12-18 15:32:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2019-12-18 15:32:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 15410 transitions. [2019-12-18 15:32:49,378 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 15410 transitions. Word has length 27 [2019-12-18 15:32:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:49,378 INFO L462 AbstractCegarLoop]: Abstraction has 4834 states and 15410 transitions. [2019-12-18 15:32:49,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 15410 transitions. [2019-12-18 15:32:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:49,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:49,383 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-18 15:32:49,383 INFO L410 AbstractCegarLoop]: === Iteration 52 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:49,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash 495555017, now seen corresponding path program 9 times [2019-12-18 15:32:49,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:49,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220203565] [2019-12-18 15:32:49,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:49,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220203565] [2019-12-18 15:32:49,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:49,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:49,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815123930] [2019-12-18 15:32:49,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:49,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:49,954 INFO L87 Difference]: Start difference. First operand 4834 states and 15410 transitions. Second operand 15 states. [2019-12-18 15:32:51,182 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-18 15:32:51,456 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-18 15:32:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:53,424 INFO L93 Difference]: Finished difference Result 8170 states and 26657 transitions. [2019-12-18 15:32:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:53,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:53,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:53,436 INFO L225 Difference]: With dead ends: 8170 [2019-12-18 15:32:53,436 INFO L226 Difference]: Without dead ends: 8170 [2019-12-18 15:32:53,436 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-18 15:32:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2019-12-18 15:32:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5836. [2019-12-18 15:32:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5836 states. [2019-12-18 15:32:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5836 states to 5836 states and 18756 transitions. [2019-12-18 15:32:53,519 INFO L78 Accepts]: Start accepts. Automaton has 5836 states and 18756 transitions. Word has length 27 [2019-12-18 15:32:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:53,519 INFO L462 AbstractCegarLoop]: Abstraction has 5836 states and 18756 transitions. [2019-12-18 15:32:53,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 5836 states and 18756 transitions. [2019-12-18 15:32:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:53,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:53,524 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-18 15:32:53,524 INFO L410 AbstractCegarLoop]: === Iteration 53 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 495555011, now seen corresponding path program 7 times [2019-12-18 15:32:53,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:53,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975462356] [2019-12-18 15:32:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:54,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975462356] [2019-12-18 15:32:54,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:54,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:54,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207455331] [2019-12-18 15:32:54,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:54,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:54,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:54,066 INFO L87 Difference]: Start difference. First operand 5836 states and 18756 transitions. Second operand 15 states. [2019-12-18 15:32:55,333 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-18 15:32:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:57,088 INFO L93 Difference]: Finished difference Result 7741 states and 25065 transitions. [2019-12-18 15:32:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:32:57,088 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:32:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:57,101 INFO L225 Difference]: With dead ends: 7741 [2019-12-18 15:32:57,101 INFO L226 Difference]: Without dead ends: 7741 [2019-12-18 15:32:57,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:32:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2019-12-18 15:32:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 4886. [2019-12-18 15:32:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-12-18 15:32:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 15577 transitions. [2019-12-18 15:32:57,218 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 15577 transitions. Word has length 27 [2019-12-18 15:32:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:57,218 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 15577 transitions. [2019-12-18 15:32:57,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:32:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 15577 transitions. [2019-12-18 15:32:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:32:57,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:57,223 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-18 15:32:57,223 INFO L410 AbstractCegarLoop]: === Iteration 54 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1660385861, now seen corresponding path program 10 times [2019-12-18 15:32:57,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:57,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110155958] [2019-12-18 15:32:57,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:57,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110155958] [2019-12-18 15:32:57,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:57,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:32:57,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937993766] [2019-12-18 15:32:57,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:32:57,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:32:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:57,887 INFO L87 Difference]: Start difference. First operand 4886 states and 15577 transitions. Second operand 15 states. [2019-12-18 15:32:59,141 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-12-18 15:33:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:00,668 INFO L93 Difference]: Finished difference Result 6800 states and 22058 transitions. [2019-12-18 15:33:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:33:00,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:33:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:00,678 INFO L225 Difference]: With dead ends: 6800 [2019-12-18 15:33:00,678 INFO L226 Difference]: Without dead ends: 6800 [2019-12-18 15:33:00,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:33:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2019-12-18 15:33:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 5696. [2019-12-18 15:33:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5696 states. [2019-12-18 15:33:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 18316 transitions. [2019-12-18 15:33:00,759 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 18316 transitions. Word has length 27 [2019-12-18 15:33:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:00,759 INFO L462 AbstractCegarLoop]: Abstraction has 5696 states and 18316 transitions. [2019-12-18 15:33:00,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:33:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 18316 transitions. [2019-12-18 15:33:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:00,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:00,764 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-18 15:33:00,764 INFO L410 AbstractCegarLoop]: === Iteration 55 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1660385855, now seen corresponding path program 8 times [2019-12-18 15:33:00,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:00,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114135592] [2019-12-18 15:33:00,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:01,134 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2019-12-18 15:33:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:01,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114135592] [2019-12-18 15:33:01,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:01,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:33:01,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481230432] [2019-12-18 15:33:01,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:33:01,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:01,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:33:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:01,426 INFO L87 Difference]: Start difference. First operand 5696 states and 18316 transitions. Second operand 15 states. [2019-12-18 15:33:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:04,201 INFO L93 Difference]: Finished difference Result 6800 states and 21913 transitions. [2019-12-18 15:33:04,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:33:04,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 15:33:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:04,212 INFO L225 Difference]: With dead ends: 6800 [2019-12-18 15:33:04,212 INFO L226 Difference]: Without dead ends: 6800 [2019-12-18 15:33:04,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:33:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2019-12-18 15:33:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 4676. [2019-12-18 15:33:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2019-12-18 15:33:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 14927 transitions. [2019-12-18 15:33:04,278 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 14927 transitions. Word has length 27 [2019-12-18 15:33:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:04,278 INFO L462 AbstractCegarLoop]: Abstraction has 4676 states and 14927 transitions. [2019-12-18 15:33:04,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:33:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 14927 transitions. [2019-12-18 15:33:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:04,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:04,282 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-18 15:33:04,282 INFO L410 AbstractCegarLoop]: === Iteration 56 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:04,282 INFO L82 PathProgramCache]: Analyzing trace with hash -783135897, now seen corresponding path program 4 times [2019-12-18 15:33:04,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:04,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432780118] [2019-12-18 15:33:04,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:04,892 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2019-12-18 15:33:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:05,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432780118] [2019-12-18 15:33:05,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:05,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:05,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645176431] [2019-12-18 15:33:05,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:05,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:05,144 INFO L87 Difference]: Start difference. First operand 4676 states and 14927 transitions. Second operand 17 states. [2019-12-18 15:33:06,317 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-18 15:33:06,542 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-18 15:33:07,184 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-18 15:33:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:08,503 INFO L93 Difference]: Finished difference Result 6327 states and 20448 transitions. [2019-12-18 15:33:08,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:33:08,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:33:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:08,513 INFO L225 Difference]: With dead ends: 6327 [2019-12-18 15:33:08,513 INFO L226 Difference]: Without dead ends: 6327 [2019-12-18 15:33:08,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:33:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2019-12-18 15:33:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 5164. [2019-12-18 15:33:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-12-18 15:33:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 16616 transitions. [2019-12-18 15:33:08,583 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 16616 transitions. Word has length 27 [2019-12-18 15:33:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:08,583 INFO L462 AbstractCegarLoop]: Abstraction has 5164 states and 16616 transitions. [2019-12-18 15:33:08,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 16616 transitions. [2019-12-18 15:33:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:08,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:08,587 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-18 15:33:08,587 INFO L410 AbstractCegarLoop]: === Iteration 57 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash -783135903, now seen corresponding path program 4 times [2019-12-18 15:33:08,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:08,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748351839] [2019-12-18 15:33:08,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:09,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748351839] [2019-12-18 15:33:09,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:09,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:09,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264057175] [2019-12-18 15:33:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:09,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:09,311 INFO L87 Difference]: Start difference. First operand 5164 states and 16616 transitions. Second operand 17 states. [2019-12-18 15:33:11,047 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-12-18 15:33:11,256 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-18 15:33:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:12,439 INFO L93 Difference]: Finished difference Result 5805 states and 18654 transitions. [2019-12-18 15:33:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:33:12,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:33:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:12,448 INFO L225 Difference]: With dead ends: 5805 [2019-12-18 15:33:12,448 INFO L226 Difference]: Without dead ends: 5805 [2019-12-18 15:33:12,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:33:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2019-12-18 15:33:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 4670. [2019-12-18 15:33:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-12-18 15:33:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 14909 transitions. [2019-12-18 15:33:12,510 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 14909 transitions. Word has length 27 [2019-12-18 15:33:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:12,511 INFO L462 AbstractCegarLoop]: Abstraction has 4670 states and 14909 transitions. [2019-12-18 15:33:12,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 14909 transitions. [2019-12-18 15:33:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:12,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:12,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:12,514 INFO L410 AbstractCegarLoop]: === Iteration 58 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:12,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1974887137, now seen corresponding path program 5 times [2019-12-18 15:33:12,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:12,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150418085] [2019-12-18 15:33:12,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:13,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150418085] [2019-12-18 15:33:13,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:13,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:13,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157193314] [2019-12-18 15:33:13,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:13,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:13,284 INFO L87 Difference]: Start difference. First operand 4670 states and 14909 transitions. Second operand 17 states. [2019-12-18 15:33:14,580 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-12-18 15:33:14,735 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-18 15:33:14,973 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 15:33:15,153 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-18 15:33:15,374 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-18 15:33:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:16,628 INFO L93 Difference]: Finished difference Result 7210 states and 23183 transitions. [2019-12-18 15:33:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:33:16,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:33:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:16,638 INFO L225 Difference]: With dead ends: 7210 [2019-12-18 15:33:16,638 INFO L226 Difference]: Without dead ends: 7210 [2019-12-18 15:33:16,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:33:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7210 states. [2019-12-18 15:33:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7210 to 4724. [2019-12-18 15:33:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-12-18 15:33:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 15071 transitions. [2019-12-18 15:33:16,709 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 15071 transitions. Word has length 27 [2019-12-18 15:33:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:16,709 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 15071 transitions. [2019-12-18 15:33:16,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 15071 transitions. [2019-12-18 15:33:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:16,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:16,713 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-18 15:33:16,713 INFO L410 AbstractCegarLoop]: === Iteration 59 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash 552992441, now seen corresponding path program 6 times [2019-12-18 15:33:16,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:16,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723384511] [2019-12-18 15:33:16,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:17,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723384511] [2019-12-18 15:33:17,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:17,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:33:17,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459954796] [2019-12-18 15:33:17,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:17,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:17,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:17,313 INFO L87 Difference]: Start difference. First operand 4724 states and 15071 transitions. Second operand 16 states. [2019-12-18 15:33:18,874 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 15:33:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:20,468 INFO L93 Difference]: Finished difference Result 7546 states and 24440 transitions. [2019-12-18 15:33:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:33:20,468 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:33:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:20,480 INFO L225 Difference]: With dead ends: 7546 [2019-12-18 15:33:20,480 INFO L226 Difference]: Without dead ends: 7546 [2019-12-18 15:33:20,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:33:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-18 15:33:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5914. [2019-12-18 15:33:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5914 states. [2019-12-18 15:33:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 18970 transitions. [2019-12-18 15:33:20,562 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 18970 transitions. Word has length 27 [2019-12-18 15:33:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:20,562 INFO L462 AbstractCegarLoop]: Abstraction has 5914 states and 18970 transitions. [2019-12-18 15:33:20,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 18970 transitions. [2019-12-18 15:33:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:20,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:20,567 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-18 15:33:20,567 INFO L410 AbstractCegarLoop]: === Iteration 60 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:20,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash 552992435, now seen corresponding path program 5 times [2019-12-18 15:33:20,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:20,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008368044] [2019-12-18 15:33:20,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:21,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008368044] [2019-12-18 15:33:21,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:21,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:33:21,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094552171] [2019-12-18 15:33:21,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:21,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:21,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:21,234 INFO L87 Difference]: Start difference. First operand 5914 states and 18970 transitions. Second operand 16 states. [2019-12-18 15:33:21,733 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-12-18 15:33:22,820 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 15:33:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:24,359 INFO L93 Difference]: Finished difference Result 7117 states and 22848 transitions. [2019-12-18 15:33:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:33:24,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:33:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:24,370 INFO L225 Difference]: With dead ends: 7117 [2019-12-18 15:33:24,370 INFO L226 Difference]: Without dead ends: 7117 [2019-12-18 15:33:24,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:33:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2019-12-18 15:33:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 4616. [2019-12-18 15:33:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4616 states. [2019-12-18 15:33:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 14747 transitions. [2019-12-18 15:33:24,442 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 14747 transitions. Word has length 27 [2019-12-18 15:33:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:24,442 INFO L462 AbstractCegarLoop]: Abstraction has 4616 states and 14747 transitions. [2019-12-18 15:33:24,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 14747 transitions. [2019-12-18 15:33:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:24,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:24,446 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-18 15:33:24,446 INFO L410 AbstractCegarLoop]: === Iteration 61 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1110689729, now seen corresponding path program 7 times [2019-12-18 15:33:24,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:24,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960618760] [2019-12-18 15:33:24,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:25,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-18 15:33:25,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960618760] [2019-12-18 15:33:25,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:25,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:25,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621299611] [2019-12-18 15:33:25,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:25,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:25,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:25,295 INFO L87 Difference]: Start difference. First operand 4616 states and 14747 transitions. Second operand 17 states. [2019-12-18 15:33:26,722 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-12-18 15:33:26,977 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 15:33:27,160 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 15:33:27,388 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 15:33:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:28,560 INFO L93 Difference]: Finished difference Result 6084 states and 19651 transitions. [2019-12-18 15:33:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:33:28,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:33:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:28,569 INFO L225 Difference]: With dead ends: 6084 [2019-12-18 15:33:28,569 INFO L226 Difference]: Without dead ends: 6084 [2019-12-18 15:33:28,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:33:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2019-12-18 15:33:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 4544. [2019-12-18 15:33:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-12-18 15:33:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 14531 transitions. [2019-12-18 15:33:28,627 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 14531 transitions. Word has length 27 [2019-12-18 15:33:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:28,627 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 14531 transitions. [2019-12-18 15:33:28,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 14531 transitions. [2019-12-18 15:33:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:28,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:28,630 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-18 15:33:28,630 INFO L410 AbstractCegarLoop]: === Iteration 62 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash -311204967, now seen corresponding path program 8 times [2019-12-18 15:33:28,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:28,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394346573] [2019-12-18 15:33:28,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:29,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-18 15:33:29,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394346573] [2019-12-18 15:33:29,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:29,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:33:29,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941301218] [2019-12-18 15:33:29,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:29,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:29,264 INFO L87 Difference]: Start difference. First operand 4544 states and 14531 transitions. Second operand 16 states. [2019-12-18 15:33:30,811 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 15:33:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:32,332 INFO L93 Difference]: Finished difference Result 7354 states and 23864 transitions. [2019-12-18 15:33:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:33:32,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:33:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:32,344 INFO L225 Difference]: With dead ends: 7354 [2019-12-18 15:33:32,344 INFO L226 Difference]: Without dead ends: 7354 [2019-12-18 15:33:32,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:33:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7354 states. [2019-12-18 15:33:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7354 to 5734. [2019-12-18 15:33:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2019-12-18 15:33:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 18430 transitions. [2019-12-18 15:33:32,424 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 18430 transitions. Word has length 27 [2019-12-18 15:33:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:32,425 INFO L462 AbstractCegarLoop]: Abstraction has 5734 states and 18430 transitions. [2019-12-18 15:33:32,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 18430 transitions. [2019-12-18 15:33:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:32,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:32,429 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-18 15:33:32,429 INFO L410 AbstractCegarLoop]: === Iteration 63 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash -311204973, now seen corresponding path program 6 times [2019-12-18 15:33:32,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:32,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16391704] [2019-12-18 15:33:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:32,939 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-12-18 15:33:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:33,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16391704] [2019-12-18 15:33:33,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:33,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:33:33,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180087277] [2019-12-18 15:33:33,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:33,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:33,165 INFO L87 Difference]: Start difference. First operand 5734 states and 18430 transitions. Second operand 16 states. [2019-12-18 15:33:34,720 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-18 15:33:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:36,199 INFO L93 Difference]: Finished difference Result 6925 states and 22272 transitions. [2019-12-18 15:33:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:33:36,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:33:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:36,209 INFO L225 Difference]: With dead ends: 6925 [2019-12-18 15:33:36,209 INFO L226 Difference]: Without dead ends: 6925 [2019-12-18 15:33:36,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:33:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2019-12-18 15:33:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 4490. [2019-12-18 15:33:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4490 states. [2019-12-18 15:33:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 14369 transitions. [2019-12-18 15:33:36,274 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 14369 transitions. Word has length 27 [2019-12-18 15:33:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:36,274 INFO L462 AbstractCegarLoop]: Abstraction has 4490 states and 14369 transitions. [2019-12-18 15:33:36,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 14369 transitions. [2019-12-18 15:33:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:36,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:36,277 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-18 15:33:36,278 INFO L410 AbstractCegarLoop]: === Iteration 64 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash 190808577, now seen corresponding path program 9 times [2019-12-18 15:33:36,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:36,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120435689] [2019-12-18 15:33:36,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:37,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120435689] [2019-12-18 15:33:37,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:37,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:37,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436903017] [2019-12-18 15:33:37,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:37,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:37,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:37,045 INFO L87 Difference]: Start difference. First operand 4490 states and 14369 transitions. Second operand 17 states. [2019-12-18 15:33:38,983 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-12-18 15:33:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:40,889 INFO L93 Difference]: Finished difference Result 6534 states and 21250 transitions. [2019-12-18 15:33:40,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:33:40,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:33:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:40,900 INFO L225 Difference]: With dead ends: 6534 [2019-12-18 15:33:40,900 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 15:33:40,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:33:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 15:33:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 5500. [2019-12-18 15:33:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5500 states. [2019-12-18 15:33:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5500 states to 5500 states and 17728 transitions. [2019-12-18 15:33:40,972 INFO L78 Accepts]: Start accepts. Automaton has 5500 states and 17728 transitions. Word has length 27 [2019-12-18 15:33:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:40,973 INFO L462 AbstractCegarLoop]: Abstraction has 5500 states and 17728 transitions. [2019-12-18 15:33:40,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5500 states and 17728 transitions. [2019-12-18 15:33:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:40,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:40,978 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-18 15:33:40,978 INFO L410 AbstractCegarLoop]: === Iteration 65 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash 190808571, now seen corresponding path program 7 times [2019-12-18 15:33:40,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:40,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142008099] [2019-12-18 15:33:40,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:41,492 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-12-18 15:33:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:41,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142008099] [2019-12-18 15:33:41,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:33:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019181752] [2019-12-18 15:33:41,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:33:41,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:33:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:33:41,696 INFO L87 Difference]: Start difference. First operand 5500 states and 17728 transitions. Second operand 17 states. [2019-12-18 15:33:42,936 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-18 15:33:43,213 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-18 15:33:43,532 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-18 15:33:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:45,379 INFO L93 Difference]: Finished difference Result 6534 states and 21105 transitions. [2019-12-18 15:33:45,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 15:33:45,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-18 15:33:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:45,390 INFO L225 Difference]: With dead ends: 6534 [2019-12-18 15:33:45,390 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 15:33:45,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 15:33:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 4310. [2019-12-18 15:33:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4310 states. [2019-12-18 15:33:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 13829 transitions. [2019-12-18 15:33:45,453 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 13829 transitions. Word has length 27 [2019-12-18 15:33:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:45,453 INFO L462 AbstractCegarLoop]: Abstraction has 4310 states and 13829 transitions. [2019-12-18 15:33:45,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:33:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 13829 transitions. [2019-12-18 15:33:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:45,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:45,456 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-18 15:33:45,456 INFO L410 AbstractCegarLoop]: === Iteration 66 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722431, now seen corresponding path program 10 times [2019-12-18 15:33:45,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:45,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452993455] [2019-12-18 15:33:45,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:46,107 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-12-18 15:33:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:46,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452993455] [2019-12-18 15:33:46,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:46,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:33:46,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155020223] [2019-12-18 15:33:46,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:46,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:46,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:46,340 INFO L87 Difference]: Start difference. First operand 4310 states and 13829 transitions. Second operand 16 states. [2019-12-18 15:33:47,882 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-18 15:33:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:49,725 INFO L93 Difference]: Finished difference Result 6294 states and 20530 transitions. [2019-12-18 15:33:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:33:49,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:33:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:49,734 INFO L225 Difference]: With dead ends: 6294 [2019-12-18 15:33:49,734 INFO L226 Difference]: Without dead ends: 6294 [2019-12-18 15:33:49,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:33:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6294 states. [2019-12-18 15:33:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6294 to 5260. [2019-12-18 15:33:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2019-12-18 15:33:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 17008 transitions. [2019-12-18 15:33:49,800 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 17008 transitions. Word has length 27 [2019-12-18 15:33:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:49,800 INFO L462 AbstractCegarLoop]: Abstraction has 5260 states and 17008 transitions. [2019-12-18 15:33:49,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 17008 transitions. [2019-12-18 15:33:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:49,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:49,804 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-18 15:33:49,804 INFO L410 AbstractCegarLoop]: === Iteration 67 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722437, now seen corresponding path program 8 times [2019-12-18 15:33:49,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:49,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086209180] [2019-12-18 15:33:49,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:50,265 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2019-12-18 15:33:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:50,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086209180] [2019-12-18 15:33:50,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:50,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:33:50,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072217132] [2019-12-18 15:33:50,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:50,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:50,608 INFO L87 Difference]: Start difference. First operand 5260 states and 17008 transitions. Second operand 16 states. [2019-12-18 15:33:51,768 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 15:33:52,048 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-12-18 15:33:52,366 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-18 15:33:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:54,159 INFO L93 Difference]: Finished difference Result 5865 states and 18938 transitions. [2019-12-18 15:33:54,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:33:54,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 15:33:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:54,168 INFO L225 Difference]: With dead ends: 5865 [2019-12-18 15:33:54,168 INFO L226 Difference]: Without dead ends: 5865 [2019-12-18 15:33:54,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:33:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5865 states. [2019-12-18 15:33:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 4250. [2019-12-18 15:33:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4250 states. [2019-12-18 15:33:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 13649 transitions. [2019-12-18 15:33:54,226 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 13649 transitions. Word has length 27 [2019-12-18 15:33:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:54,227 INFO L462 AbstractCegarLoop]: Abstraction has 4250 states and 13649 transitions. [2019-12-18 15:33:54,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 13649 transitions. [2019-12-18 15:33:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:54,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:54,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-18 15:33:54,230 INFO L410 AbstractCegarLoop]: === Iteration 68 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash 147907303, now seen corresponding path program 11 times [2019-12-18 15:33:54,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:54,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065160957] [2019-12-18 15:33:54,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:54,886 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2019-12-18 15:33:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:55,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065160957] [2019-12-18 15:33:55,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:55,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:33:55,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119863368] [2019-12-18 15:33:55,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:33:55,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:55,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:33:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:33:55,142 INFO L87 Difference]: Start difference. First operand 4250 states and 13649 transitions. Second operand 18 states. [2019-12-18 15:33:57,240 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-18 15:33:57,433 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 15:33:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:58,513 INFO L93 Difference]: Finished difference Result 6174 states and 20165 transitions. [2019-12-18 15:33:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:33:58,514 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-12-18 15:33:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:58,524 INFO L225 Difference]: With dead ends: 6174 [2019-12-18 15:33:58,524 INFO L226 Difference]: Without dead ends: 6174 [2019-12-18 15:33:58,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:33:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2019-12-18 15:33:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 5060. [2019-12-18 15:33:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2019-12-18 15:33:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16388 transitions. [2019-12-18 15:33:58,591 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16388 transitions. Word has length 27 [2019-12-18 15:33:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:58,591 INFO L462 AbstractCegarLoop]: Abstraction has 5060 states and 16388 transitions. [2019-12-18 15:33:58,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:33:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16388 transitions. [2019-12-18 15:33:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:33:58,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:58,595 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-18 15:33:58,595 INFO L410 AbstractCegarLoop]: === Iteration 69 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:58,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:58,595 INFO L82 PathProgramCache]: Analyzing trace with hash 147907297, now seen corresponding path program 9 times [2019-12-18 15:33:58,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:58,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46073701] [2019-12-18 15:33:58,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:59,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46073701] [2019-12-18 15:33:59,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:59,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:33:59,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550185499] [2019-12-18 15:33:59,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:33:59,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:33:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:33:59,471 INFO L87 Difference]: Start difference. First operand 5060 states and 16388 transitions. Second operand 18 states. [2019-12-18 15:34:01,665 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 15:34:01,834 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 Received shutdown request... [2019-12-18 15:34:02,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:34:02,408 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:34:02,413 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:34:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:34:02 BasicIcfg [2019-12-18 15:34:02,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:34:02,414 INFO L168 Benchmark]: Toolchain (without parser) took 238514.52 ms. Allocated memory was 146.8 MB in the beginning and 720.9 MB in the end (delta: 574.1 MB). Free memory was 102.7 MB in the beginning and 477.3 MB in the end (delta: -374.6 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,415 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 982.07 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.3 MB in the beginning and 125.5 MB in the end (delta: -23.2 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.66 ms. Allocated memory is still 205.0 MB. Free memory was 125.5 MB in the beginning and 122.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,416 INFO L168 Benchmark]: Boogie Preprocessor took 42.22 ms. Allocated memory is still 205.0 MB. Free memory was 122.2 MB in the beginning and 120.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,416 INFO L168 Benchmark]: RCFGBuilder took 749.04 ms. Allocated memory was 205.0 MB in the beginning and 234.9 MB in the end (delta: 29.9 MB). Free memory was 120.2 MB in the beginning and 190.0 MB in the end (delta: -69.8 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,417 INFO L168 Benchmark]: TraceAbstraction took 236665.60 ms. Allocated memory was 234.9 MB in the beginning and 720.9 MB in the end (delta: 486.0 MB). Free memory was 188.6 MB in the beginning and 477.3 MB in the end (delta: -288.7 MB). Peak memory consumption was 197.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,419 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 982.07 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.3 MB in the beginning and 125.5 MB in the end (delta: -23.2 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.66 ms. Allocated memory is still 205.0 MB. Free memory was 125.5 MB in the beginning and 122.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.22 ms. Allocated memory is still 205.0 MB. Free memory was 122.2 MB in the beginning and 120.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 749.04 ms. Allocated memory was 205.0 MB in the beginning and 234.9 MB in the end (delta: 29.9 MB). Free memory was 120.2 MB in the beginning and 190.0 MB in the end (delta: -69.8 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236665.60 ms. Allocated memory was 234.9 MB in the beginning and 720.9 MB in the end (delta: 486.0 MB). Free memory was 188.6 MB in the beginning and 477.3 MB in the end (delta: -288.7 MB). Peak memory consumption was 197.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 189 ProgramPointsBefore, 59 ProgramPointsAfterwards, 201 TransitionsBefore, 65 TransitionsAfterwards, 16584 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 7 ChoiceCompositions, 8663 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 267 SemBasedMoverChecksPositive, 138 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 27423 CheckedPairsTotal, 166 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 (5060states) and FLOYD_HOARE automaton (currently 19 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (5060states) and FLOYD_HOARE automaton (currently 19 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (5060states) and FLOYD_HOARE automaton (currently 19 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (5060states) and FLOYD_HOARE automaton (currently 19 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3105 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 4 error locations. Result: TIMEOUT, OverallTime: 236.4s, OverallIterations: 69, TraceHistogramMax: 1, AutomataDifference: 181.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4498 SDtfs, 17766 SDslu, 19944 SDs, 0 SdLazy, 103549 SolverSat, 1517 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 103.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1732 GetRequests, 43 SyntacticMatches, 38 SemanticMatches, 1651 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5291 ImplicationChecksByTransitivity, 96.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6316occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 68 MinimizatonAttempts, 75214 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 41.7s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1717 ConstructedInterpolants, 0 QuantifiedInterpolants, 1237050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 69 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