/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:31:02,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:31:02,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:31:02,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:31:02,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:31:02,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:31:02,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:31:02,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:31:02,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:31:02,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:31:02,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:31:02,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:31:02,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:31:02,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:31:02,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:31:02,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:31:02,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:31:02,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:31:02,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:31:02,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:31:02,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:31:02,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:31:02,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:31:02,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:31:02,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:31:02,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:31:02,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:31:02,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:31:02,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:31:02,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:31:02,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:31:02,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:31:02,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:31:02,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:31:02,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:31:02,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:31:02,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:31:02,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:31:02,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:31:02,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:31:02,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:31:02,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:31:02,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:31:02,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:31:02,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:31:02,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:31:02,777 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:31:02,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:31:02,778 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:31:02,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:31:02,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:31:02,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:31:02,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:31:02,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:31:02,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:31:02,779 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:31:02,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:31:02,779 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:31:02,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:31:02,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:31:02,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:31:02,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:31:02,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:31:02,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:31:02,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:31:02,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:31:02,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:31:02,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:31:02,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:31:02,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:31:02,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:31:03,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:31:03,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:31:03,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:31:03,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:31:03,069 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:31:03,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 04:31:03,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0970b6cff/db484fb7c2234ad2b8f137fb61f5b6a7/FLAG181d66a43 [2019-12-27 04:31:03,729 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:31:03,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 04:31:03,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0970b6cff/db484fb7c2234ad2b8f137fb61f5b6a7/FLAG181d66a43 [2019-12-27 04:31:03,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0970b6cff/db484fb7c2234ad2b8f137fb61f5b6a7 [2019-12-27 04:31:03,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:31:03,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:31:03,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:31:03,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:31:03,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:31:03,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:31:03" (1/1) ... [2019-12-27 04:31:03,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aced33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:03, skipping insertion in model container [2019-12-27 04:31:03,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:31:03" (1/1) ... [2019-12-27 04:31:03,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:31:04,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:31:04,281 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 04:31:04,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:31:04,845 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:31:04,869 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 04:31:04,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:31:05,122 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:31:05,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05 WrapperNode [2019-12-27 04:31:05,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:31:05,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:31:05,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:31:05,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:31:05,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:31:05,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:31:05,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:31:05,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:31:05,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... [2019-12-27 04:31:05,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:31:05,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:31:05,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:31:05,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:31:05,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:31:05,327 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-27 04:31:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-27 04:31:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-27 04:31:05,328 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-27 04:31:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:31:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:31:05,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 04:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 04:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:31:05,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:31:05,331 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:31:05,953 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:31:05,954 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-27 04:31:05,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:31:05 BoogieIcfgContainer [2019-12-27 04:31:05,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:31:05,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:31:05,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:31:05,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:31:05,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:31:03" (1/3) ... [2019-12-27 04:31:05,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a486f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:31:05, skipping insertion in model container [2019-12-27 04:31:05,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:05" (2/3) ... [2019-12-27 04:31:05,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a486f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:31:05, skipping insertion in model container [2019-12-27 04:31:05,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:31:05" (3/3) ... [2019-12-27 04:31:05,963 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-27 04:31:05,979 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:31:05,980 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:31:05,988 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-27 04:31:05,989 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:31:06,032 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,032 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,032 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,033 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,033 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,033 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,033 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,034 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,034 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,034 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,034 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,035 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,035 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,035 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,035 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,036 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,036 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,036 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,036 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,037 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,037 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,037 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,037 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,038 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,038 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,038 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,038 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,039 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,039 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,039 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,039 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,040 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,040 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,040 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,040 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,040 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,041 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,041 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,041 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,041 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,042 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,042 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,042 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,042 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,042 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,042 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,043 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,043 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,043 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,043 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,044 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,044 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,044 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,044 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,044 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,047 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,047 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,047 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,047 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,048 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,048 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,048 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,048 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,048 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,049 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,049 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,049 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,049 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,050 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,050 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,050 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,050 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,050 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,051 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,051 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,051 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,051 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,051 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,052 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,052 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,052 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,052 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,053 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,053 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,053 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,053 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,053 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,053 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,054 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,054 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,054 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,054 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,055 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,055 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,055 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,055 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,056 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,056 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,056 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,056 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,057 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,057 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,057 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,057 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,058 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,058 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,058 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,058 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,059 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,059 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,059 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,059 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,060 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,060 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,060 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,060 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,060 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,061 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,061 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,061 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,061 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,061 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,062 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,063 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,063 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,063 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,063 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,063 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,064 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,064 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,064 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,064 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,065 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,066 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,066 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,066 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,067 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,067 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,067 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,067 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,067 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,068 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,068 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,069 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,069 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,069 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,069 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,070 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,072 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,072 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,072 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,073 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,073 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,073 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,073 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,074 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,074 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,075 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,075 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,075 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,075 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,076 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,076 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,076 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,076 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,076 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,076 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,077 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,077 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,077 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,077 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,077 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,079 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,079 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,079 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,080 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,080 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,080 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,080 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,080 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,080 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,081 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,081 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,081 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,081 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,082 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,082 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,082 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,082 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,083 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,083 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,083 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,083 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,084 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,084 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,084 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,084 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,085 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,085 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,085 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,086 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,086 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,086 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,086 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,087 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,087 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,087 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,087 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,093 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,093 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,100 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,100 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,100 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,100 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,101 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,101 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,101 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,101 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,101 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,102 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,102 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,103 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,107 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,107 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,107 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,108 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,126 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,126 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,126 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,127 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,127 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,127 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,127 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,127 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,127 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,128 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,128 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,128 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,128 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,128 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,128 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,131 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,131 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,131 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,132 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,132 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,132 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,132 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,132 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,132 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,133 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,133 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,133 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,133 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,133 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,134 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,135 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,135 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,135 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,136 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,136 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:31:06,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-27 04:31:06,182 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:31:06,183 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:31:06,183 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:31:06,183 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:31:06,183 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:31:06,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:31:06,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:31:06,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:31:06,200 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-27 04:31:06,202 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 04:31:06,344 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 04:31:06,344 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 04:31:06,362 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-27 04:31:06,379 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 04:31:06,433 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 04:31:06,433 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 04:31:06,439 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-27 04:31:06,459 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-27 04:31:06,460 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:31:06,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:07,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:07,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:07,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:07,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:09,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:09,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:09,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:31:10,433 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-27 04:31:10,986 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20924 [2019-12-27 04:31:10,986 INFO L214 etLargeBlockEncoding]: Total number of compositions: 153 [2019-12-27 04:31:10,990 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-27 04:31:11,097 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-27 04:31:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-27 04:31:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:31:11,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:11,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:11,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:11,128 INFO L82 PathProgramCache]: Analyzing trace with hash -437483837, now seen corresponding path program 1 times [2019-12-27 04:31:11,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:11,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833983209] [2019-12-27 04:31:11,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:11,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833983209] [2019-12-27 04:31:11,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:11,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:31:11,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995508147] [2019-12-27 04:31:11,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:31:11,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:31:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:31:11,630 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-27 04:31:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:12,022 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-27 04:31:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:31:12,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 04:31:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:12,063 INFO L225 Difference]: With dead ends: 2169 [2019-12-27 04:31:12,063 INFO L226 Difference]: Without dead ends: 2053 [2019-12-27 04:31:12,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:31:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-27 04:31:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-27 04:31:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-27 04:31:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-27 04:31:12,225 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-27 04:31:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:12,225 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-27 04:31:12,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:31:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-27 04:31:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:31:12,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:12,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:12,229 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -357357885, now seen corresponding path program 1 times [2019-12-27 04:31:12,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:12,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167498211] [2019-12-27 04:31:12,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:12,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167498211] [2019-12-27 04:31:12,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:12,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:31:12,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362687700] [2019-12-27 04:31:12,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:31:12,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:12,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:31:12,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:31:12,447 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-27 04:31:12,838 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-27 04:31:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:13,184 INFO L93 Difference]: Finished difference Result 2588 states and 8385 transitions. [2019-12-27 04:31:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:31:13,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 04:31:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:13,206 INFO L225 Difference]: With dead ends: 2588 [2019-12-27 04:31:13,206 INFO L226 Difference]: Without dead ends: 2544 [2019-12-27 04:31:13,208 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-27 04:31:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-12-27 04:31:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2019-12-27 04:31:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-27 04:31:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-27 04:31:13,303 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-27 04:31:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:13,304 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-27 04:31:13,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:31:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-27 04:31:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:31:13,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:13,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:13,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -220223314, now seen corresponding path program 1 times [2019-12-27 04:31:13,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:13,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294103958] [2019-12-27 04:31:13,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:14,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294103958] [2019-12-27 04:31:14,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:14,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:31:14,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254617579] [2019-12-27 04:31:14,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:31:14,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:31:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:31:14,004 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 14 states. [2019-12-27 04:31:15,805 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-27 04:31:16,069 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 04:31:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:16,313 INFO L93 Difference]: Finished difference Result 3164 states and 10236 transitions. [2019-12-27 04:31:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:31:16,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 04:31:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:16,337 INFO L225 Difference]: With dead ends: 3164 [2019-12-27 04:31:16,337 INFO L226 Difference]: Without dead ends: 3164 [2019-12-27 04:31:16,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:31:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-12-27 04:31:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3104. [2019-12-27 04:31:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-12-27 04:31:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 10106 transitions. [2019-12-27 04:31:16,435 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 10106 transitions. Word has length 25 [2019-12-27 04:31:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:16,437 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 10106 transitions. [2019-12-27 04:31:16,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:31:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 10106 transitions. [2019-12-27 04:31:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:31:16,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:16,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:16,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1041383458, now seen corresponding path program 1 times [2019-12-27 04:31:16,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:16,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054883225] [2019-12-27 04:31:16,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:17,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054883225] [2019-12-27 04:31:17,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:17,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:31:17,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116301842] [2019-12-27 04:31:17,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:31:17,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:31:17,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:31:17,010 INFO L87 Difference]: Start difference. First operand 3104 states and 10106 transitions. Second operand 12 states. [2019-12-27 04:31:18,518 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-27 04:31:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:18,745 INFO L93 Difference]: Finished difference Result 3654 states and 11776 transitions. [2019-12-27 04:31:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:31:18,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 04:31:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:18,771 INFO L225 Difference]: With dead ends: 3654 [2019-12-27 04:31:18,771 INFO L226 Difference]: Without dead ends: 3654 [2019-12-27 04:31:18,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:31:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-27 04:31:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-27 04:31:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-27 04:31:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-27 04:31:18,880 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-27 04:31:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:18,881 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-27 04:31:18,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:31:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-27 04:31:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:31:18,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:18,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:18,891 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 907099404, now seen corresponding path program 2 times [2019-12-27 04:31:18,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169278994] [2019-12-27 04:31:18,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:19,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169278994] [2019-12-27 04:31:19,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:19,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:31:19,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759207028] [2019-12-27 04:31:19,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:31:19,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:19,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:31:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:31:19,461 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 14 states. [2019-12-27 04:31:22,034 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-27 04:31:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:22,288 INFO L93 Difference]: Finished difference Result 5414 states and 17426 transitions. [2019-12-27 04:31:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:31:22,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 04:31:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:22,327 INFO L225 Difference]: With dead ends: 5414 [2019-12-27 04:31:22,327 INFO L226 Difference]: Without dead ends: 5414 [2019-12-27 04:31:22,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:31:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-12-27 04:31:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 3844. [2019-12-27 04:31:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-27 04:31:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 12546 transitions. [2019-12-27 04:31:22,493 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 12546 transitions. Word has length 25 [2019-12-27 04:31:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:22,493 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 12546 transitions. [2019-12-27 04:31:22,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:31:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 12546 transitions. [2019-12-27 04:31:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:31:22,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:22,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:22,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 356628326, now seen corresponding path program 3 times [2019-12-27 04:31:22,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:22,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339671441] [2019-12-27 04:31:22,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:22,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339671441] [2019-12-27 04:31:22,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:22,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:31:22,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437359281] [2019-12-27 04:31:22,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:31:22,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:22,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:31:22,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:31:22,968 INFO L87 Difference]: Start difference. First operand 3844 states and 12546 transitions. Second operand 13 states. [2019-12-27 04:31:26,376 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-27 04:31:26,543 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-12-27 04:31:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:26,901 INFO L93 Difference]: Finished difference Result 4818 states and 15403 transitions. [2019-12-27 04:31:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 04:31:26,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 04:31:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:26,917 INFO L225 Difference]: With dead ends: 4818 [2019-12-27 04:31:26,918 INFO L226 Difference]: Without dead ends: 4818 [2019-12-27 04:31:26,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:31:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2019-12-27 04:31:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3188. [2019-12-27 04:31:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-27 04:31:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-27 04:31:27,017 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-27 04:31:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:27,017 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-27 04:31:27,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:31:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-27 04:31:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:31:27,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:27,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:27,024 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1491389276, now seen corresponding path program 2 times [2019-12-27 04:31:27,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:27,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723210710] [2019-12-27 04:31:27,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:27,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723210710] [2019-12-27 04:31:27,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:27,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:31:27,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993738168] [2019-12-27 04:31:27,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:31:27,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:31:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:31:27,559 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 13 states. [2019-12-27 04:31:30,011 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-27 04:31:30,376 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-27 04:31:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:30,695 INFO L93 Difference]: Finished difference Result 4168 states and 13116 transitions. [2019-12-27 04:31:30,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:31:30,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 04:31:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:30,705 INFO L225 Difference]: With dead ends: 4168 [2019-12-27 04:31:30,705 INFO L226 Difference]: Without dead ends: 4168 [2019-12-27 04:31:30,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:31:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-12-27 04:31:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 3188. [2019-12-27 04:31:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-27 04:31:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10166 transitions. [2019-12-27 04:31:30,795 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10166 transitions. Word has length 25 [2019-12-27 04:31:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:30,795 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10166 transitions. [2019-12-27 04:31:30,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:31:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10166 transitions. [2019-12-27 04:31:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:31:30,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:30,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:30,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1997301412, now seen corresponding path program 3 times [2019-12-27 04:31:30,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:30,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675093022] [2019-12-27 04:31:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:31,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-27 04:31:31,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675093022] [2019-12-27 04:31:31,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:31,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:31:31,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217266161] [2019-12-27 04:31:31,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:31:31,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:31,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:31:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:31:31,235 INFO L87 Difference]: Start difference. First operand 3188 states and 10166 transitions. Second operand 13 states. [2019-12-27 04:31:33,254 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-12-27 04:31:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:33,718 INFO L93 Difference]: Finished difference Result 3972 states and 12550 transitions. [2019-12-27 04:31:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:31:33,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 04:31:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:33,725 INFO L225 Difference]: With dead ends: 3972 [2019-12-27 04:31:33,725 INFO L226 Difference]: Without dead ends: 3972 [2019-12-27 04:31:33,725 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-27 04:31:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2019-12-27 04:31:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2852. [2019-12-27 04:31:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-27 04:31:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-27 04:31:33,805 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-27 04:31:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:33,805 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-27 04:31:33,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:31:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-27 04:31:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:33,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:33,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:33,811 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:33,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512480, now seen corresponding path program 1 times [2019-12-27 04:31:33,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:33,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382485828] [2019-12-27 04:31:33,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:34,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382485828] [2019-12-27 04:31:34,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:34,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:31:34,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483069074] [2019-12-27 04:31:34,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:31:34,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:34,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:31:34,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:31:34,547 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 16 states. [2019-12-27 04:31:35,848 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-27 04:31:36,175 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-27 04:31:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:37,500 INFO L93 Difference]: Finished difference Result 5092 states and 16416 transitions. [2019-12-27 04:31:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:31:37,501 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:31:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:37,511 INFO L225 Difference]: With dead ends: 5092 [2019-12-27 04:31:37,511 INFO L226 Difference]: Without dead ends: 5092 [2019-12-27 04:31:37,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:31:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2019-12-27 04:31:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4102. [2019-12-27 04:31:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-27 04:31:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13138 transitions. [2019-12-27 04:31:37,621 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13138 transitions. Word has length 27 [2019-12-27 04:31:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:37,621 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13138 transitions. [2019-12-27 04:31:37,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:31:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13138 transitions. [2019-12-27 04:31:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:37,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:37,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-27 04:31:37,630 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512479, now seen corresponding path program 1 times [2019-12-27 04:31:37,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:37,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012973502] [2019-12-27 04:31:37,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:38,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012973502] [2019-12-27 04:31:38,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:38,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:31:38,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219961645] [2019-12-27 04:31:38,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:31:38,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:31:38,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:31:38,344 INFO L87 Difference]: Start difference. First operand 4102 states and 13138 transitions. Second operand 16 states. [2019-12-27 04:31:39,426 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-27 04:31:39,935 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-27 04:31:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:41,243 INFO L93 Difference]: Finished difference Result 5017 states and 16132 transitions. [2019-12-27 04:31:41,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:31:41,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:31:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:41,251 INFO L225 Difference]: With dead ends: 5017 [2019-12-27 04:31:41,252 INFO L226 Difference]: Without dead ends: 5017 [2019-12-27 04:31:41,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:31:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-12-27 04:31:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2019-12-27 04:31:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-27 04:31:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13063 transitions. [2019-12-27 04:31:41,346 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13063 transitions. Word has length 27 [2019-12-27 04:31:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:41,347 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13063 transitions. [2019-12-27 04:31:41,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:31:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13063 transitions. [2019-12-27 04:31:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:41,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:41,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:41,354 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash 363501539, now seen corresponding path program 1 times [2019-12-27 04:31:41,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:41,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119741146] [2019-12-27 04:31:41,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:41,883 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2019-12-27 04:31:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:42,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119741146] [2019-12-27 04:31:42,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:42,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:31:42,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413085864] [2019-12-27 04:31:42,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:31:42,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:31:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:31:42,096 INFO L87 Difference]: Start difference. First operand 4102 states and 13063 transitions. Second operand 15 states. [2019-12-27 04:31:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:44,674 INFO L93 Difference]: Finished difference Result 6137 states and 19825 transitions. [2019-12-27 04:31:44,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:31:44,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:31:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:44,683 INFO L225 Difference]: With dead ends: 6137 [2019-12-27 04:31:44,683 INFO L226 Difference]: Without dead ends: 6137 [2019-12-27 04:31:44,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:31:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-27 04:31:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 5222. [2019-12-27 04:31:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-12-27 04:31:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 16711 transitions. [2019-12-27 04:31:44,801 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 16711 transitions. Word has length 27 [2019-12-27 04:31:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:44,802 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 16711 transitions. [2019-12-27 04:31:44,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:31:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 16711 transitions. [2019-12-27 04:31:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:44,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:44,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:44,813 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash 363501540, now seen corresponding path program 1 times [2019-12-27 04:31:44,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:44,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679276106] [2019-12-27 04:31:44,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:45,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679276106] [2019-12-27 04:31:45,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:45,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:31:45,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726980219] [2019-12-27 04:31:45,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:31:45,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:31:45,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:31:45,413 INFO L87 Difference]: Start difference. First operand 5222 states and 16711 transitions. Second operand 14 states. [2019-12-27 04:31:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:47,635 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-27 04:31:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:31:47,635 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-27 04:31:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:47,644 INFO L225 Difference]: With dead ends: 6137 [2019-12-27 04:31:47,644 INFO L226 Difference]: Without dead ends: 6137 [2019-12-27 04:31:47,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:31:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-27 04:31:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-27 04:31:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-27 04:31:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-27 04:31:47,755 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-27 04:31:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:47,755 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-27 04:31:47,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:31:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-27 04:31:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:47,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:47,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:47,765 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139074, now seen corresponding path program 2 times [2019-12-27 04:31:47,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:47,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125395930] [2019-12-27 04:31:47,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:48,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125395930] [2019-12-27 04:31:48,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:48,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:31:48,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759021964] [2019-12-27 04:31:48,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:31:48,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:31:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:31:48,426 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 15 states. [2019-12-27 04:31:49,454 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-12-27 04:31:49,737 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-27 04:31:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:51,570 INFO L93 Difference]: Finished difference Result 7404 states and 23605 transitions. [2019-12-27 04:31:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:31:51,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:31:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:51,584 INFO L225 Difference]: With dead ends: 7404 [2019-12-27 04:31:51,584 INFO L226 Difference]: Without dead ends: 7404 [2019-12-27 04:31:51,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:31:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2019-12-27 04:31:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 5934. [2019-12-27 04:31:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2019-12-27 04:31:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 18887 transitions. [2019-12-27 04:31:51,719 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 18887 transitions. Word has length 27 [2019-12-27 04:31:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:51,720 INFO L462 AbstractCegarLoop]: Abstraction has 5934 states and 18887 transitions. [2019-12-27 04:31:51,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:31:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 18887 transitions. [2019-12-27 04:31:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:51,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:51,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:51,732 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:51,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139073, now seen corresponding path program 2 times [2019-12-27 04:31:51,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:51,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620155957] [2019-12-27 04:31:51,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:52,261 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-12-27 04:31:52,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-27 04:31:52,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620155957] [2019-12-27 04:31:52,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:52,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:31:52,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967686643] [2019-12-27 04:31:52,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:31:52,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:31:52,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:31:52,509 INFO L87 Difference]: Start difference. First operand 5934 states and 18887 transitions. Second operand 16 states. [2019-12-27 04:31:53,928 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 04:31:54,268 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-27 04:31:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:31:55,922 INFO L93 Difference]: Finished difference Result 7329 states and 23321 transitions. [2019-12-27 04:31:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:31:55,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:31:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:31:55,934 INFO L225 Difference]: With dead ends: 7329 [2019-12-27 04:31:55,934 INFO L226 Difference]: Without dead ends: 7329 [2019-12-27 04:31:55,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:31:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-27 04:31:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 4804. [2019-12-27 04:31:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-27 04:31:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-27 04:31:56,051 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-27 04:31:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:31:56,052 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-27 04:31:56,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:31:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-27 04:31:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:31:56,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:31:56,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:31:56,062 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:31:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:31:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227084, now seen corresponding path program 3 times [2019-12-27 04:31:56,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:31:56,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548084178] [2019-12-27 04:31:56,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:31:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:31:56,508 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-12-27 04:31:56,678 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-12-27 04:31:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:31:56,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548084178] [2019-12-27 04:31:56,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:31:56,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:31:56,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398191685] [2019-12-27 04:31:56,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:31:56,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:31:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:31:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:31:56,915 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-27 04:31:58,260 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-27 04:31:58,550 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-27 04:32:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:00,304 INFO L93 Difference]: Finished difference Result 6814 states and 21845 transitions. [2019-12-27 04:32:00,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:32:00,304 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:00,315 INFO L225 Difference]: With dead ends: 6814 [2019-12-27 04:32:00,315 INFO L226 Difference]: Without dead ends: 6814 [2019-12-27 04:32:00,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:32:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2019-12-27 04:32:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5754. [2019-12-27 04:32:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5754 states. [2019-12-27 04:32:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 18347 transitions. [2019-12-27 04:32:00,435 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 18347 transitions. Word has length 27 [2019-12-27 04:32:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:00,435 INFO L462 AbstractCegarLoop]: Abstraction has 5754 states and 18347 transitions. [2019-12-27 04:32:00,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 18347 transitions. [2019-12-27 04:32:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:00,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:00,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:00,445 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227083, now seen corresponding path program 3 times [2019-12-27 04:32:00,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:00,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729434294] [2019-12-27 04:32:00,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:01,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729434294] [2019-12-27 04:32:01,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:01,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:01,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970592769] [2019-12-27 04:32:01,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:01,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:01,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:01,150 INFO L87 Difference]: Start difference. First operand 5754 states and 18347 transitions. Second operand 16 states. [2019-12-27 04:32:02,497 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-27 04:32:02,779 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 04:32:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:04,527 INFO L93 Difference]: Finished difference Result 6739 states and 21561 transitions. [2019-12-27 04:32:04,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:32:04,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:04,537 INFO L225 Difference]: With dead ends: 6739 [2019-12-27 04:32:04,537 INFO L226 Difference]: Without dead ends: 6739 [2019-12-27 04:32:04,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:32:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2019-12-27 04:32:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 4804. [2019-12-27 04:32:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-27 04:32:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-27 04:32:04,631 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-27 04:32:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:04,631 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-27 04:32:04,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-27 04:32:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:04,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:04,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:04,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 796249174, now seen corresponding path program 4 times [2019-12-27 04:32:04,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:04,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781395322] [2019-12-27 04:32:04,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:05,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781395322] [2019-12-27 04:32:05,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:05,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:05,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587302090] [2019-12-27 04:32:05,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:05,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:05,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:05,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:05,279 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-27 04:32:05,780 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-12-27 04:32:06,284 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-12-27 04:32:06,515 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-27 04:32:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:08,689 INFO L93 Difference]: Finished difference Result 6619 states and 21201 transitions. [2019-12-27 04:32:08,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:32:08,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:08,705 INFO L225 Difference]: With dead ends: 6619 [2019-12-27 04:32:08,705 INFO L226 Difference]: Without dead ends: 6619 [2019-12-27 04:32:08,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:32:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-27 04:32:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4804. [2019-12-27 04:32:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-27 04:32:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-27 04:32:08,810 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-27 04:32:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:08,811 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-27 04:32:08,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-27 04:32:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:08,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:08,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:08,818 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash 471322490, now seen corresponding path program 5 times [2019-12-27 04:32:08,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:08,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354265139] [2019-12-27 04:32:08,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:09,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-27 04:32:09,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354265139] [2019-12-27 04:32:09,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:09,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:09,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444351490] [2019-12-27 04:32:09,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:09,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:09,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:09,520 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-27 04:32:10,052 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-12-27 04:32:10,847 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 04:32:11,261 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-27 04:32:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:13,425 INFO L93 Difference]: Finished difference Result 8562 states and 27805 transitions. [2019-12-27 04:32:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:32:13,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:13,438 INFO L225 Difference]: With dead ends: 8562 [2019-12-27 04:32:13,438 INFO L226 Difference]: Without dead ends: 8562 [2019-12-27 04:32:13,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:32:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-12-27 04:32:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 5539. [2019-12-27 04:32:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2019-12-27 04:32:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 17692 transitions. [2019-12-27 04:32:13,530 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 17692 transitions. Word has length 27 [2019-12-27 04:32:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:13,531 INFO L462 AbstractCegarLoop]: Abstraction has 5539 states and 17692 transitions. [2019-12-27 04:32:13,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 17692 transitions. [2019-12-27 04:32:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:13,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:13,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:13,539 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 471322491, now seen corresponding path program 4 times [2019-12-27 04:32:13,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:13,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261439650] [2019-12-27 04:32:13,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:13,972 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-12-27 04:32:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:14,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261439650] [2019-12-27 04:32:14,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:14,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:14,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249883891] [2019-12-27 04:32:14,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:14,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:14,202 INFO L87 Difference]: Start difference. First operand 5539 states and 17692 transitions. Second operand 16 states. [2019-12-27 04:32:15,387 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-12-27 04:32:15,742 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-27 04:32:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:17,573 INFO L93 Difference]: Finished difference Result 8562 states and 27685 transitions. [2019-12-27 04:32:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:32:17,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:17,587 INFO L225 Difference]: With dead ends: 8562 [2019-12-27 04:32:17,587 INFO L226 Difference]: Without dead ends: 8562 [2019-12-27 04:32:17,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:32:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-12-27 04:32:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 4849. [2019-12-27 04:32:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-27 04:32:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-27 04:32:17,670 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-27 04:32:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:17,671 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-27 04:32:17,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-27 04:32:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:17,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:17,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:17,676 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -869839874, now seen corresponding path program 6 times [2019-12-27 04:32:17,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:17,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764986298] [2019-12-27 04:32:17,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:18,174 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2019-12-27 04:32:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:18,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764986298] [2019-12-27 04:32:18,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:18,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:18,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346399997] [2019-12-27 04:32:18,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:18,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:18,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:18,408 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-27 04:32:19,957 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-27 04:32:20,285 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 04:32:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:21,982 INFO L93 Difference]: Finished difference Result 7194 states and 23046 transitions. [2019-12-27 04:32:21,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:32:21,982 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:21,993 INFO L225 Difference]: With dead ends: 7194 [2019-12-27 04:32:21,993 INFO L226 Difference]: Without dead ends: 7194 [2019-12-27 04:32:21,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:32:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-12-27 04:32:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 6159. [2019-12-27 04:32:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6159 states. [2019-12-27 04:32:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6159 states to 6159 states and 19572 transitions. [2019-12-27 04:32:22,077 INFO L78 Accepts]: Start accepts. Automaton has 6159 states and 19572 transitions. Word has length 27 [2019-12-27 04:32:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:22,078 INFO L462 AbstractCegarLoop]: Abstraction has 6159 states and 19572 transitions. [2019-12-27 04:32:22,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6159 states and 19572 transitions. [2019-12-27 04:32:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:22,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:22,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:22,085 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash -869839873, now seen corresponding path program 5 times [2019-12-27 04:32:22,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:22,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317425712] [2019-12-27 04:32:22,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:22,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317425712] [2019-12-27 04:32:22,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:22,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:22,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970349187] [2019-12-27 04:32:22,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:22,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:22,759 INFO L87 Difference]: Start difference. First operand 6159 states and 19572 transitions. Second operand 16 states. [2019-12-27 04:32:24,272 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-12-27 04:32:24,578 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-27 04:32:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:26,173 INFO L93 Difference]: Finished difference Result 7194 states and 22926 transitions. [2019-12-27 04:32:26,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:32:26,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:26,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:26,183 INFO L225 Difference]: With dead ends: 7194 [2019-12-27 04:32:26,184 INFO L226 Difference]: Without dead ends: 7194 [2019-12-27 04:32:26,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:32:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-12-27 04:32:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 4849. [2019-12-27 04:32:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-27 04:32:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-27 04:32:26,257 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-27 04:32:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:26,257 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-27 04:32:26,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-27 04:32:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:26,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:26,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:26,264 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360997, now seen corresponding path program 2 times [2019-12-27 04:32:26,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:26,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197744990] [2019-12-27 04:32:26,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:26,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197744990] [2019-12-27 04:32:26,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:26,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:26,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881746601] [2019-12-27 04:32:26,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:26,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:26,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:26,995 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-27 04:32:28,174 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-12-27 04:32:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:30,158 INFO L93 Difference]: Finished difference Result 7028 states and 22548 transitions. [2019-12-27 04:32:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:32:30,159 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:30,169 INFO L225 Difference]: With dead ends: 7028 [2019-12-27 04:32:30,169 INFO L226 Difference]: Without dead ends: 7028 [2019-12-27 04:32:30,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:32:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-27 04:32:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 6003. [2019-12-27 04:32:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6003 states. [2019-12-27 04:32:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 19104 transitions. [2019-12-27 04:32:30,248 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 19104 transitions. Word has length 27 [2019-12-27 04:32:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:30,248 INFO L462 AbstractCegarLoop]: Abstraction has 6003 states and 19104 transitions. [2019-12-27 04:32:30,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 19104 transitions. [2019-12-27 04:32:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:30,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:30,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:30,254 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:30,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360998, now seen corresponding path program 2 times [2019-12-27 04:32:30,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:30,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76226917] [2019-12-27 04:32:30,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:30,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76226917] [2019-12-27 04:32:30,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:30,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:32:30,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602063392] [2019-12-27 04:32:30,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:32:30,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:32:30,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:32:30,895 INFO L87 Difference]: Start difference. First operand 6003 states and 19104 transitions. Second operand 16 states. [2019-12-27 04:32:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:34,079 INFO L93 Difference]: Finished difference Result 7028 states and 22428 transitions. [2019-12-27 04:32:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:32:34,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:32:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:34,091 INFO L225 Difference]: With dead ends: 7028 [2019-12-27 04:32:34,091 INFO L226 Difference]: Without dead ends: 7028 [2019-12-27 04:32:34,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:32:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-27 04:32:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 4733. [2019-12-27 04:32:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-27 04:32:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-27 04:32:34,160 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-27 04:32:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:34,161 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-27 04:32:34,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:32:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-27 04:32:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:34,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:34,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:34,167 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash -122346011, now seen corresponding path program 3 times [2019-12-27 04:32:34,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:34,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917772046] [2019-12-27 04:32:34,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:34,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917772046] [2019-12-27 04:32:34,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:34,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:34,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441042448] [2019-12-27 04:32:34,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:34,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:34,782 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-27 04:32:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:37,546 INFO L93 Difference]: Finished difference Result 6548 states and 20998 transitions. [2019-12-27 04:32:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:32:37,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:37,556 INFO L225 Difference]: With dead ends: 6548 [2019-12-27 04:32:37,556 INFO L226 Difference]: Without dead ends: 6548 [2019-12-27 04:32:37,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:32:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-12-27 04:32:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 4733. [2019-12-27 04:32:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-27 04:32:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-27 04:32:37,638 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-27 04:32:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:37,638 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-27 04:32:37,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-27 04:32:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:37,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:37,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:37,642 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665119, now seen corresponding path program 4 times [2019-12-27 04:32:37,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:37,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514854976] [2019-12-27 04:32:37,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:38,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514854976] [2019-12-27 04:32:38,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:38,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:38,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128880870] [2019-12-27 04:32:38,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:38,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:38,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:38,311 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-27 04:32:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:41,350 INFO L93 Difference]: Finished difference Result 8491 states and 27602 transitions. [2019-12-27 04:32:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:32:41,350 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:41,363 INFO L225 Difference]: With dead ends: 8491 [2019-12-27 04:32:41,363 INFO L226 Difference]: Without dead ends: 8491 [2019-12-27 04:32:41,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:32:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-27 04:32:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 5468. [2019-12-27 04:32:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2019-12-27 04:32:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 17489 transitions. [2019-12-27 04:32:41,460 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 17489 transitions. Word has length 27 [2019-12-27 04:32:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:41,460 INFO L462 AbstractCegarLoop]: Abstraction has 5468 states and 17489 transitions. [2019-12-27 04:32:41,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 17489 transitions. [2019-12-27 04:32:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:41,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:41,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:41,467 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665118, now seen corresponding path program 3 times [2019-12-27 04:32:41,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:41,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281524622] [2019-12-27 04:32:41,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:42,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281524622] [2019-12-27 04:32:42,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:42,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:42,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677595033] [2019-12-27 04:32:42,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:42,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:42,115 INFO L87 Difference]: Start difference. First operand 5468 states and 17489 transitions. Second operand 15 states. [2019-12-27 04:32:43,400 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-27 04:32:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:45,293 INFO L93 Difference]: Finished difference Result 8491 states and 27482 transitions. [2019-12-27 04:32:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:32:45,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:45,306 INFO L225 Difference]: With dead ends: 8491 [2019-12-27 04:32:45,306 INFO L226 Difference]: Without dead ends: 8491 [2019-12-27 04:32:45,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:32:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-27 04:32:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 4739. [2019-12-27 04:32:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 04:32:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-27 04:32:45,391 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-27 04:32:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:45,391 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-27 04:32:45,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-27 04:32:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:45,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:45,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:45,395 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 14057405, now seen corresponding path program 5 times [2019-12-27 04:32:45,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:45,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840283702] [2019-12-27 04:32:45,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:46,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-27 04:32:46,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840283702] [2019-12-27 04:32:46,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:46,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:46,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484436729] [2019-12-27 04:32:46,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:46,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:46,051 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-27 04:32:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:48,680 INFO L93 Difference]: Finished difference Result 6594 states and 21247 transitions. [2019-12-27 04:32:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:32:48,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:48,689 INFO L225 Difference]: With dead ends: 6594 [2019-12-27 04:32:48,689 INFO L226 Difference]: Without dead ends: 6594 [2019-12-27 04:32:48,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:32:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2019-12-27 04:32:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 5679. [2019-12-27 04:32:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-12-27 04:32:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 18133 transitions. [2019-12-27 04:32:48,757 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 18133 transitions. Word has length 27 [2019-12-27 04:32:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:48,757 INFO L462 AbstractCegarLoop]: Abstraction has 5679 states and 18133 transitions. [2019-12-27 04:32:48,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 18133 transitions. [2019-12-27 04:32:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:48,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:48,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:48,762 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 14057406, now seen corresponding path program 4 times [2019-12-27 04:32:48,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:48,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393065404] [2019-12-27 04:32:48,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:49,306 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-27 04:32:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393065404] [2019-12-27 04:32:49,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:49,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:49,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984877528] [2019-12-27 04:32:49,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:49,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:49,536 INFO L87 Difference]: Start difference. First operand 5679 states and 18133 transitions. Second operand 15 states. [2019-12-27 04:32:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:52,577 INFO L93 Difference]: Finished difference Result 6594 states and 21127 transitions. [2019-12-27 04:32:52,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:32:52,578 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:52,587 INFO L225 Difference]: With dead ends: 6594 [2019-12-27 04:32:52,587 INFO L226 Difference]: Without dead ends: 6594 [2019-12-27 04:32:52,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:32:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2019-12-27 04:32:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4739. [2019-12-27 04:32:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 04:32:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-27 04:32:52,656 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-27 04:32:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:52,656 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-27 04:32:52,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-27 04:32:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:52,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:52,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:52,660 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775101, now seen corresponding path program 6 times [2019-12-27 04:32:52,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:52,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760916728] [2019-12-27 04:32:52,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:32:53,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760916728] [2019-12-27 04:32:53,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:53,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:53,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144127538] [2019-12-27 04:32:53,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:53,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:53,347 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-27 04:32:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:55,927 INFO L93 Difference]: Finished difference Result 6784 states and 21797 transitions. [2019-12-27 04:32:55,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:32:55,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:55,939 INFO L225 Difference]: With dead ends: 6784 [2019-12-27 04:32:55,939 INFO L226 Difference]: Without dead ends: 6784 [2019-12-27 04:32:55,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:32:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-12-27 04:32:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 5429. [2019-12-27 04:32:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2019-12-27 04:32:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 17363 transitions. [2019-12-27 04:32:56,018 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 17363 transitions. Word has length 27 [2019-12-27 04:32:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:56,018 INFO L462 AbstractCegarLoop]: Abstraction has 5429 states and 17363 transitions. [2019-12-27 04:32:56,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 17363 transitions. [2019-12-27 04:32:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:56,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:56,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:56,023 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775100, now seen corresponding path program 5 times [2019-12-27 04:32:56,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:56,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350172953] [2019-12-27 04:32:56,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:32:56,510 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-12-27 04:32:56,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-27 04:32:56,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350172953] [2019-12-27 04:32:56,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:32:56,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:32:56,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290745357] [2019-12-27 04:32:56,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:32:56,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:32:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:32:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:32:56,730 INFO L87 Difference]: Start difference. First operand 5429 states and 17363 transitions. Second operand 15 states. [2019-12-27 04:32:58,024 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-27 04:32:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:32:59,505 INFO L93 Difference]: Finished difference Result 6784 states and 21677 transitions. [2019-12-27 04:32:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:32:59,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:32:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:32:59,518 INFO L225 Difference]: With dead ends: 6784 [2019-12-27 04:32:59,519 INFO L226 Difference]: Without dead ends: 6784 [2019-12-27 04:32:59,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:32:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-12-27 04:32:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 4049. [2019-12-27 04:32:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-27 04:32:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12935 transitions. [2019-12-27 04:32:59,598 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12935 transitions. Word has length 27 [2019-12-27 04:32:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:32:59,598 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12935 transitions. [2019-12-27 04:32:59,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:32:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12935 transitions. [2019-12-27 04:32:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:32:59,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:32:59,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:32:59,602 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:32:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:32:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907358, now seen corresponding path program 7 times [2019-12-27 04:32:59,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:32:59,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3468486] [2019-12-27 04:32:59,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:32:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:00,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3468486] [2019-12-27 04:33:00,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:00,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:33:00,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402704486] [2019-12-27 04:33:00,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:33:00,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:33:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:33:00,153 INFO L87 Difference]: Start difference. First operand 4049 states and 12935 transitions. Second operand 15 states. [2019-12-27 04:33:01,200 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-27 04:33:01,467 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-27 04:33:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:03,197 INFO L93 Difference]: Finished difference Result 6029 states and 19451 transitions. [2019-12-27 04:33:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:33:03,197 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 04:33:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:03,206 INFO L225 Difference]: With dead ends: 6029 [2019-12-27 04:33:03,206 INFO L226 Difference]: Without dead ends: 6029 [2019-12-27 04:33:03,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:33:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2019-12-27 04:33:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 4739. [2019-12-27 04:33:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 04:33:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15273 transitions. [2019-12-27 04:33:03,274 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15273 transitions. Word has length 27 [2019-12-27 04:33:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:03,274 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15273 transitions. [2019-12-27 04:33:03,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:33:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15273 transitions. [2019-12-27 04:33:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:33:03,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:03,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:03,278 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907357, now seen corresponding path program 6 times [2019-12-27 04:33:03,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:03,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129780858] [2019-12-27 04:33:03,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:03,859 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-12-27 04:33:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:04,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129780858] [2019-12-27 04:33:04,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:04,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:33:04,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165476768] [2019-12-27 04:33:04,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:33:04,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:04,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:33:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:33:04,105 INFO L87 Difference]: Start difference. First operand 4739 states and 15273 transitions. Second operand 16 states. [2019-12-27 04:33:05,382 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 04:33:05,665 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-27 04:33:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:07,164 INFO L93 Difference]: Finished difference Result 5954 states and 19167 transitions. [2019-12-27 04:33:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:33:07,165 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 04:33:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:07,174 INFO L225 Difference]: With dead ends: 5954 [2019-12-27 04:33:07,174 INFO L226 Difference]: Without dead ends: 5954 [2019-12-27 04:33:07,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:33:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-12-27 04:33:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3549. [2019-12-27 04:33:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-27 04:33:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-27 04:33:07,229 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-27 04:33:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:07,229 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-27 04:33:07,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:33:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-27 04:33:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:07,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:07,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:07,233 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash 399516870, now seen corresponding path program 1 times [2019-12-27 04:33:07,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:07,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846572169] [2019-12-27 04:33:07,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:08,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846572169] [2019-12-27 04:33:08,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:08,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:33:08,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623037013] [2019-12-27 04:33:08,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:33:08,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:33:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:33:08,307 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 20 states. [2019-12-27 04:33:08,674 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-27 04:33:08,890 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-27 04:33:09,166 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-12-27 04:33:09,429 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-12-27 04:33:09,890 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2019-12-27 04:33:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:12,196 INFO L93 Difference]: Finished difference Result 7420 states and 24247 transitions. [2019-12-27 04:33:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:33:12,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 04:33:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:12,208 INFO L225 Difference]: With dead ends: 7420 [2019-12-27 04:33:12,209 INFO L226 Difference]: Without dead ends: 7420 [2019-12-27 04:33:12,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 04:33:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2019-12-27 04:33:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 4814. [2019-12-27 04:33:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-12-27 04:33:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 15490 transitions. [2019-12-27 04:33:12,280 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 15490 transitions. Word has length 30 [2019-12-27 04:33:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:12,281 INFO L462 AbstractCegarLoop]: Abstraction has 4814 states and 15490 transitions. [2019-12-27 04:33:12,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:33:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 15490 transitions. [2019-12-27 04:33:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:12,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:12,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:12,287 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1461784035, now seen corresponding path program 1 times [2019-12-27 04:33:12,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:12,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940415433] [2019-12-27 04:33:12,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:13,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940415433] [2019-12-27 04:33:13,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:13,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:33:13,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119137628] [2019-12-27 04:33:13,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:33:13,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:33:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:33:13,259 INFO L87 Difference]: Start difference. First operand 4814 states and 15490 transitions. Second operand 19 states. [2019-12-27 04:33:13,728 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-27 04:33:13,935 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-27 04:33:14,329 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-27 04:33:14,740 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2019-12-27 04:33:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:16,490 INFO L93 Difference]: Finished difference Result 8625 states and 28142 transitions. [2019-12-27 04:33:16,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:33:16,490 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 04:33:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:16,504 INFO L225 Difference]: With dead ends: 8625 [2019-12-27 04:33:16,504 INFO L226 Difference]: Without dead ends: 8625 [2019-12-27 04:33:16,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2019-12-27 04:33:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2019-12-27 04:33:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 5356. [2019-12-27 04:33:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5356 states. [2019-12-27 04:33:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 17165 transitions. [2019-12-27 04:33:16,586 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 17165 transitions. Word has length 30 [2019-12-27 04:33:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:16,586 INFO L462 AbstractCegarLoop]: Abstraction has 5356 states and 17165 transitions. [2019-12-27 04:33:16,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:33:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 17165 transitions. [2019-12-27 04:33:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:16,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:16,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:16,591 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:16,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:16,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1491245864, now seen corresponding path program 2 times [2019-12-27 04:33:16,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:16,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000161646] [2019-12-27 04:33:16,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:16,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000161646] [2019-12-27 04:33:16,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:16,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:33:16,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667426539] [2019-12-27 04:33:16,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:33:16,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:33:16,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:33:16,934 INFO L87 Difference]: Start difference. First operand 5356 states and 17165 transitions. Second operand 13 states. [2019-12-27 04:33:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:18,995 INFO L93 Difference]: Finished difference Result 13929 states and 44959 transitions. [2019-12-27 04:33:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:33:18,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-27 04:33:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:19,016 INFO L225 Difference]: With dead ends: 13929 [2019-12-27 04:33:19,016 INFO L226 Difference]: Without dead ends: 13929 [2019-12-27 04:33:19,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:33:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2019-12-27 04:33:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 8916. [2019-12-27 04:33:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8916 states. [2019-12-27 04:33:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8916 states to 8916 states and 29285 transitions. [2019-12-27 04:33:19,217 INFO L78 Accepts]: Start accepts. Automaton has 8916 states and 29285 transitions. Word has length 30 [2019-12-27 04:33:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:19,217 INFO L462 AbstractCegarLoop]: Abstraction has 8916 states and 29285 transitions. [2019-12-27 04:33:19,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:33:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 8916 states and 29285 transitions. [2019-12-27 04:33:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:19,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:19,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:19,228 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -674363086, now seen corresponding path program 3 times [2019-12-27 04:33:19,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:19,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104758060] [2019-12-27 04:33:19,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:20,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104758060] [2019-12-27 04:33:20,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:20,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:33:20,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026825270] [2019-12-27 04:33:20,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:33:20,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:33:20,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:33:20,070 INFO L87 Difference]: Start difference. First operand 8916 states and 29285 transitions. Second operand 19 states. [2019-12-27 04:33:21,025 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-27 04:33:21,315 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-27 04:33:21,555 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-27 04:33:21,780 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-27 04:33:22,484 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-12-27 04:33:22,728 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-12-27 04:33:22,951 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-12-27 04:33:23,360 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-27 04:33:23,852 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-27 04:33:24,044 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-12-27 04:33:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:26,916 INFO L93 Difference]: Finished difference Result 13681 states and 44884 transitions. [2019-12-27 04:33:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:33:26,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 04:33:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:26,937 INFO L225 Difference]: With dead ends: 13681 [2019-12-27 04:33:26,937 INFO L226 Difference]: Without dead ends: 13681 [2019-12-27 04:33:26,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=393, Invalid=1329, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:33:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2019-12-27 04:33:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 8966. [2019-12-27 04:33:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-12-27 04:33:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 29435 transitions. [2019-12-27 04:33:27,075 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 29435 transitions. Word has length 30 [2019-12-27 04:33:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:27,075 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 29435 transitions. [2019-12-27 04:33:27,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:33:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 29435 transitions. [2019-12-27 04:33:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:27,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:27,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:27,083 INFO L410 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1862000664, now seen corresponding path program 4 times [2019-12-27 04:33:27,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:27,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422662101] [2019-12-27 04:33:27,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:27,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422662101] [2019-12-27 04:33:27,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:27,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:33:27,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489166568] [2019-12-27 04:33:27,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:33:27,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:33:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:33:27,914 INFO L87 Difference]: Start difference. First operand 8966 states and 29435 transitions. Second operand 19 states. [2019-12-27 04:33:28,558 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 04:33:28,910 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-12-27 04:33:29,200 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-27 04:33:29,435 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-27 04:33:29,663 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-27 04:33:30,307 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-12-27 04:33:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:33,651 INFO L93 Difference]: Finished difference Result 13459 states and 44289 transitions. [2019-12-27 04:33:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:33:33,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 04:33:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:33,672 INFO L225 Difference]: With dead ends: 13459 [2019-12-27 04:33:33,672 INFO L226 Difference]: Without dead ends: 13459 [2019-12-27 04:33:33,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:33:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2019-12-27 04:33:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 9116. [2019-12-27 04:33:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 04:33:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29885 transitions. [2019-12-27 04:33:33,808 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29885 transitions. Word has length 30 [2019-12-27 04:33:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:33,808 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29885 transitions. [2019-12-27 04:33:33,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:33:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29885 transitions. [2019-12-27 04:33:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:33,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:33,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:33,816 INFO L410 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1889101151, now seen corresponding path program 2 times [2019-12-27 04:33:33,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:33,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539285279] [2019-12-27 04:33:33,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:34,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539285279] [2019-12-27 04:33:34,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:34,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:33:34,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927715122] [2019-12-27 04:33:34,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:33:34,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:34,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:33:34,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:33:34,618 INFO L87 Difference]: Start difference. First operand 9116 states and 29885 transitions. Second operand 19 states. [2019-12-27 04:33:35,475 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-27 04:33:35,669 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-27 04:33:35,910 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-27 04:33:36,093 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-27 04:33:36,596 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-27 04:33:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:40,005 INFO L93 Difference]: Finished difference Result 13859 states and 45489 transitions. [2019-12-27 04:33:40,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 04:33:40,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 04:33:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:40,027 INFO L225 Difference]: With dead ends: 13859 [2019-12-27 04:33:40,028 INFO L226 Difference]: Without dead ends: 13859 [2019-12-27 04:33:40,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 04:33:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13859 states. [2019-12-27 04:33:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13859 to 9116. [2019-12-27 04:33:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 04:33:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29885 transitions. [2019-12-27 04:33:40,176 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29885 transitions. Word has length 30 [2019-12-27 04:33:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:40,176 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29885 transitions. [2019-12-27 04:33:40,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:33:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29885 transitions. [2019-12-27 04:33:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:40,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:40,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:40,186 INFO L410 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1617209505, now seen corresponding path program 3 times [2019-12-27 04:33:40,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:40,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891166137] [2019-12-27 04:33:40,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:40,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891166137] [2019-12-27 04:33:40,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:40,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:33:40,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353973256] [2019-12-27 04:33:40,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:33:40,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:33:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:33:40,983 INFO L87 Difference]: Start difference. First operand 9116 states and 29885 transitions. Second operand 19 states. [2019-12-27 04:33:41,844 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-27 04:33:42,067 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-27 04:33:42,569 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-12-27 04:33:42,821 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-27 04:33:43,163 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-12-27 04:33:43,352 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-12-27 04:33:45,600 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-27 04:33:46,293 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-12-27 04:33:46,678 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-12-27 04:33:46,842 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-12-27 04:33:47,191 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-12-27 04:33:47,586 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-27 04:33:47,776 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-12-27 04:33:48,162 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-27 04:33:48,665 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-12-27 04:33:49,949 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-27 04:33:50,577 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-12-27 04:33:50,888 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-12-27 04:33:51,157 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-12-27 04:33:51,442 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-12-27 04:33:51,771 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-27 04:33:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:52,081 INFO L93 Difference]: Finished difference Result 20928 states and 69598 transitions. [2019-12-27 04:33:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 04:33:52,081 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 04:33:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:52,114 INFO L225 Difference]: With dead ends: 20928 [2019-12-27 04:33:52,114 INFO L226 Difference]: Without dead ends: 20928 [2019-12-27 04:33:52,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=820, Invalid=2372, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 04:33:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2019-12-27 04:33:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 11162. [2019-12-27 04:33:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 04:33:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 37373 transitions. [2019-12-27 04:33:52,309 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 37373 transitions. Word has length 30 [2019-12-27 04:33:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:52,309 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 37373 transitions. [2019-12-27 04:33:52,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:33:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 37373 transitions. [2019-12-27 04:33:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:33:52,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:52,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:52,320 INFO L410 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2122653751, now seen corresponding path program 4 times [2019-12-27 04:33:52,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:52,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800233392] [2019-12-27 04:33:52,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:52,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800233392] [2019-12-27 04:33:52,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:52,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 04:33:52,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416543839] [2019-12-27 04:33:52,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:33:52,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:52,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:33:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:33:52,977 INFO L87 Difference]: Start difference. First operand 11162 states and 37373 transitions. Second operand 17 states. [2019-12-27 04:33:53,918 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-27 04:33:54,441 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-12-27 04:33:54,975 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-12-27 04:33:55,170 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-27 04:33:55,318 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-12-27 04:33:57,922 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-12-27 04:33:58,410 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-12-27 04:33:58,683 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-27 04:33:58,909 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-12-27 04:33:59,127 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-12-27 04:34:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:01,164 INFO L93 Difference]: Finished difference Result 21452 states and 71187 transitions. [2019-12-27 04:34:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:34:01,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-12-27 04:34:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:01,197 INFO L225 Difference]: With dead ends: 21452 [2019-12-27 04:34:01,198 INFO L226 Difference]: Without dead ends: 21452 [2019-12-27 04:34:01,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=540, Invalid=1440, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 04:34:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2019-12-27 04:34:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 10584. [2019-12-27 04:34:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10584 states. [2019-12-27 04:34:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10584 states to 10584 states and 35593 transitions. [2019-12-27 04:34:01,479 INFO L78 Accepts]: Start accepts. Automaton has 10584 states and 35593 transitions. Word has length 30 [2019-12-27 04:34:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:01,479 INFO L462 AbstractCegarLoop]: Abstraction has 10584 states and 35593 transitions. [2019-12-27 04:34:01,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:34:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10584 states and 35593 transitions. [2019-12-27 04:34:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:34:01,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:01,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:01,490 INFO L410 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 784664900, now seen corresponding path program 5 times [2019-12-27 04:34:01,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:01,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035434246] [2019-12-27 04:34:01,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:01,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035434246] [2019-12-27 04:34:01,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:01,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:34:01,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926533361] [2019-12-27 04:34:01,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:34:01,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:34:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:34:01,792 INFO L87 Difference]: Start difference. First operand 10584 states and 35593 transitions. Second operand 13 states. [2019-12-27 04:34:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:03,732 INFO L93 Difference]: Finished difference Result 18340 states and 61352 transitions. [2019-12-27 04:34:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:34:03,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-27 04:34:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:03,761 INFO L225 Difference]: With dead ends: 18340 [2019-12-27 04:34:03,761 INFO L226 Difference]: Without dead ends: 18340 [2019-12-27 04:34:03,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:34:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18340 states. [2019-12-27 04:34:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18340 to 9836. [2019-12-27 04:34:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9836 states. [2019-12-27 04:34:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9836 states to 9836 states and 33224 transitions. [2019-12-27 04:34:03,935 INFO L78 Accepts]: Start accepts. Automaton has 9836 states and 33224 transitions. Word has length 30 [2019-12-27 04:34:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:03,936 INFO L462 AbstractCegarLoop]: Abstraction has 9836 states and 33224 transitions. [2019-12-27 04:34:03,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:34:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9836 states and 33224 transitions. [2019-12-27 04:34:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:34:03,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:03,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:03,945 INFO L410 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -838148739, now seen corresponding path program 1 times [2019-12-27 04:34:03,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:03,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894050772] [2019-12-27 04:34:03,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:04,425 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-12-27 04:34:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:04,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894050772] [2019-12-27 04:34:04,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:04,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:34:04,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135373047] [2019-12-27 04:34:04,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:34:04,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:34:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:34:04,726 INFO L87 Difference]: Start difference. First operand 9836 states and 33224 transitions. Second operand 19 states. [2019-12-27 04:34:05,962 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-12-27 04:34:06,163 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-27 04:34:06,467 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-12-27 04:34:06,634 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-27 04:34:06,802 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-27 04:34:07,050 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-12-27 04:34:07,222 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 04:34:07,398 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-27 04:34:07,824 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-12-27 04:34:08,021 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-27 04:34:08,428 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-12-27 04:34:08,631 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-12-27 04:34:09,458 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2019-12-27 04:34:10,108 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-27 04:34:10,277 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-27 04:34:10,447 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-27 04:34:10,698 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-27 04:34:10,894 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2019-12-27 04:34:11,085 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-27 04:34:11,411 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-12-27 04:34:11,642 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-27 04:34:11,847 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-12-27 04:34:12,104 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-12-27 04:34:12,347 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-12-27 04:34:12,574 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-12-27 04:34:12,850 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 04:34:13,123 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-27 04:34:13,435 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-12-27 04:34:13,715 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-12-27 04:34:14,140 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2019-12-27 04:34:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:14,348 INFO L93 Difference]: Finished difference Result 11116 states and 37084 transitions. [2019-12-27 04:34:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 04:34:14,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 04:34:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:14,365 INFO L225 Difference]: With dead ends: 11116 [2019-12-27 04:34:14,365 INFO L226 Difference]: Without dead ends: 11116 [2019-12-27 04:34:14,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1130, Invalid=2776, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 04:34:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2019-12-27 04:34:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 10736. [2019-12-27 04:34:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10736 states. [2019-12-27 04:34:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10736 states to 10736 states and 35984 transitions. [2019-12-27 04:34:14,501 INFO L78 Accepts]: Start accepts. Automaton has 10736 states and 35984 transitions. Word has length 31 [2019-12-27 04:34:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:14,501 INFO L462 AbstractCegarLoop]: Abstraction has 10736 states and 35984 transitions. [2019-12-27 04:34:14,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:34:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10736 states and 35984 transitions. [2019-12-27 04:34:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:34:14,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:14,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:14,511 INFO L410 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1965024921, now seen corresponding path program 2 times [2019-12-27 04:34:14,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:14,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840460649] [2019-12-27 04:34:14,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:15,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840460649] [2019-12-27 04:34:15,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:15,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 04:34:15,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77573746] [2019-12-27 04:34:15,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:34:15,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:34:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:34:15,414 INFO L87 Difference]: Start difference. First operand 10736 states and 35984 transitions. Second operand 20 states. [2019-12-27 04:34:16,997 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-27 04:34:17,159 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-27 04:34:17,368 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-12-27 04:34:17,744 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-27 04:34:17,912 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-12-27 04:34:18,395 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 04:34:18,568 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-12-27 04:34:18,752 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-12-27 04:34:19,244 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-27 04:34:19,448 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-12-27 04:34:19,911 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-27 04:34:20,109 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 04:34:21,117 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-12-27 04:34:21,977 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-27 04:34:22,154 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-27 04:34:22,327 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-27 04:34:22,507 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-27 04:34:22,761 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-27 04:34:22,978 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-27 04:34:23,185 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-12-27 04:34:23,542 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-27 04:34:23,850 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-12-27 04:34:24,050 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-27 04:34:24,282 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 04:34:24,541 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-12-27 04:34:24,780 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-12-27 04:34:25,072 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-27 04:34:25,358 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-12-27 04:34:25,696 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-12-27 04:34:26,002 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-12-27 04:34:26,433 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-12-27 04:34:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:26,588 INFO L93 Difference]: Finished difference Result 11456 states and 38144 transitions. [2019-12-27 04:34:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 04:34:26,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-27 04:34:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:26,604 INFO L225 Difference]: With dead ends: 11456 [2019-12-27 04:34:26,605 INFO L226 Difference]: Without dead ends: 11456 [2019-12-27 04:34:26,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1310, Invalid=3520, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 04:34:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11456 states. [2019-12-27 04:34:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11456 to 10496. [2019-12-27 04:34:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10496 states. [2019-12-27 04:34:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10496 states to 10496 states and 35264 transitions. [2019-12-27 04:34:26,741 INFO L78 Accepts]: Start accepts. Automaton has 10496 states and 35264 transitions. Word has length 31 [2019-12-27 04:34:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:26,742 INFO L462 AbstractCegarLoop]: Abstraction has 10496 states and 35264 transitions. [2019-12-27 04:34:26,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:34:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10496 states and 35264 transitions. [2019-12-27 04:34:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:34:26,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:26,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:26,753 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash 288220857, now seen corresponding path program 3 times [2019-12-27 04:34:26,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:26,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863748854] [2019-12-27 04:34:26,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:27,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863748854] [2019-12-27 04:34:27,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:27,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:34:27,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532877212] [2019-12-27 04:34:27,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:34:27,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:27,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:34:27,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:34:27,629 INFO L87 Difference]: Start difference. First operand 10496 states and 35264 transitions. Second operand 19 states. [2019-12-27 04:34:29,225 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-12-27 04:34:29,523 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-12-27 04:34:29,709 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-12-27 04:34:30,084 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-27 04:34:30,248 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-27 04:34:30,802 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 04:34:30,974 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-12-27 04:34:31,145 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-27 04:34:31,649 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-27 04:34:31,841 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-27 04:34:32,310 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-27 04:34:32,505 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-12-27 04:34:33,517 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-12-27 04:34:33,762 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-27 04:34:34,367 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-27 04:34:34,539 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-27 04:34:34,707 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-27 04:34:34,885 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-27 04:34:35,135 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-27 04:34:35,350 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-27 04:34:35,560 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-27 04:34:35,939 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2019-12-27 04:34:36,246 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2019-12-27 04:34:36,447 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 04:34:36,625 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 04:34:36,863 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 04:34:37,118 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-27 04:34:37,337 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-27 04:34:37,660 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-27 04:34:37,940 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-12-27 04:34:38,265 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2019-12-27 04:34:38,538 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-12-27 04:34:39,029 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-12-27 04:34:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:39,330 INFO L93 Difference]: Finished difference Result 10756 states and 36004 transitions. [2019-12-27 04:34:39,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 04:34:39,331 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 04:34:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:39,347 INFO L225 Difference]: With dead ends: 10756 [2019-12-27 04:34:39,348 INFO L226 Difference]: Without dead ends: 10756 [2019-12-27 04:34:39,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1374, Invalid=3596, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 04:34:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-27 04:34:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10356. [2019-12-27 04:34:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10356 states. [2019-12-27 04:34:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10356 states to 10356 states and 34804 transitions. [2019-12-27 04:34:39,480 INFO L78 Accepts]: Start accepts. Automaton has 10356 states and 34804 transitions. Word has length 31 [2019-12-27 04:34:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:39,480 INFO L462 AbstractCegarLoop]: Abstraction has 10356 states and 34804 transitions. [2019-12-27 04:34:39,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:34:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10356 states and 34804 transitions. [2019-12-27 04:34:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:34:39,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:39,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:39,490 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1133622845, now seen corresponding path program 4 times [2019-12-27 04:34:39,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:39,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003962566] [2019-12-27 04:34:39,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:40,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003962566] [2019-12-27 04:34:40,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:40,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:34:40,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857061552] [2019-12-27 04:34:40,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:34:40,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:34:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:34:40,276 INFO L87 Difference]: Start difference. First operand 10356 states and 34804 transitions. Second operand 19 states. [2019-12-27 04:34:42,064 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-12-27 04:34:42,645 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-27 04:34:43,048 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-27 04:34:43,299 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-27 04:34:43,490 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-12-27 04:34:44,011 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-27 04:34:44,180 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-27 04:34:44,440 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-27 04:34:44,922 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-27 04:34:45,157 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 04:34:45,666 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-12-27 04:34:45,853 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-27 04:34:46,805 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-12-27 04:34:47,525 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-27 04:34:47,684 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-27 04:34:47,869 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-27 04:34:48,119 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-27 04:34:48,305 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-27 04:34:48,504 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-27 04:34:48,726 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-12-27 04:34:48,961 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-27 04:34:49,221 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-27 04:34:49,490 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-27 04:34:49,747 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 04:34:49,998 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-12-27 04:34:50,238 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-27 04:34:50,454 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-27 04:34:50,704 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-12-27 04:34:50,956 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-27 04:34:51,201 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 04:34:51,519 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-12-27 04:34:51,812 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-27 04:34:52,145 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2019-12-27 04:34:52,423 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-12-27 04:34:52,940 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-12-27 04:34:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:53,238 INFO L93 Difference]: Finished difference Result 12491 states and 41249 transitions. [2019-12-27 04:34:53,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 04:34:53,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 04:34:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:53,256 INFO L225 Difference]: With dead ends: 12491 [2019-12-27 04:34:53,256 INFO L226 Difference]: Without dead ends: 12491 [2019-12-27 04:34:53,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1582, Invalid=4118, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 04:34:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2019-12-27 04:34:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 10780. [2019-12-27 04:34:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-12-27 04:34:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 36096 transitions. [2019-12-27 04:34:53,400 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 36096 transitions. Word has length 31 [2019-12-27 04:34:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:53,401 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 36096 transitions. [2019-12-27 04:34:53,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:34:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 36096 transitions. [2019-12-27 04:34:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:34:53,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:53,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:53,411 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 344966205, now seen corresponding path program 5 times [2019-12-27 04:34:53,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:53,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642671865] [2019-12-27 04:34:53,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:54,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642671865] [2019-12-27 04:34:54,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:54,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:34:54,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066807592] [2019-12-27 04:34:54,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:34:54,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:34:54,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:34:54,134 INFO L87 Difference]: Start difference. First operand 10780 states and 36096 transitions. Second operand 18 states. [2019-12-27 04:34:55,657 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-27 04:34:56,134 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-12-27 04:34:56,317 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-12-27 04:34:56,477 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-12-27 04:34:56,702 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-27 04:34:56,948 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 04:34:57,073 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-12-27 04:34:57,261 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-12-27 04:34:57,727 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-27 04:34:57,904 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-12-27 04:34:58,166 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-27 04:34:58,426 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-27 04:34:58,741 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-12-27 04:34:58,976 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-27 04:34:59,439 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-27 04:34:59,640 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2019-12-27 04:35:00,489 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-12-27 04:35:01,289 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-27 04:35:01,696 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-12-27 04:35:01,869 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-27 04:35:02,049 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-27 04:35:02,251 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-12-27 04:35:02,464 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-27 04:35:02,709 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-12-27 04:35:02,913 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-27 04:35:03,208 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 04:35:03,456 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 04:35:03,697 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-27 04:35:03,898 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-27 04:35:04,138 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-12-27 04:35:04,397 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 04:35:04,634 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 04:35:04,872 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-12-27 04:35:05,117 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-12-27 04:35:05,400 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-12-27 04:35:05,740 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2019-12-27 04:35:06,017 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-12-27 04:35:06,483 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2019-12-27 04:35:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:06,699 INFO L93 Difference]: Finished difference Result 13083 states and 43107 transitions. [2019-12-27 04:35:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 04:35:06,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-12-27 04:35:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:06,717 INFO L225 Difference]: With dead ends: 13083 [2019-12-27 04:35:06,717 INFO L226 Difference]: Without dead ends: 13083 [2019-12-27 04:35:06,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1685, Invalid=4321, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 04:35:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13083 states. [2019-12-27 04:35:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13083 to 10923. [2019-12-27 04:35:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10923 states. [2019-12-27 04:35:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10923 states to 10923 states and 36547 transitions. [2019-12-27 04:35:06,858 INFO L78 Accepts]: Start accepts. Automaton has 10923 states and 36547 transitions. Word has length 31 [2019-12-27 04:35:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:06,858 INFO L462 AbstractCegarLoop]: Abstraction has 10923 states and 36547 transitions. [2019-12-27 04:35:06,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:35:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 10923 states and 36547 transitions. [2019-12-27 04:35:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:35:06,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:06,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:06,868 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_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:35:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -205504873, now seen corresponding path program 6 times [2019-12-27 04:35:06,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:06,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356961107] [2019-12-27 04:35:06,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:07,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356961107] [2019-12-27 04:35:07,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:07,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:35:07,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40611652] [2019-12-27 04:35:07,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:35:07,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:07,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:35:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:35:07,686 INFO L87 Difference]: Start difference. First operand 10923 states and 36547 transitions. Second operand 19 states. Received shutdown request... [2019-12-27 04:35:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:35:09,259 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 04:35:09,262 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 04:35:09,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:35:09 BasicIcfg [2019-12-27 04:35:09,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:35:09,266 INFO L168 Benchmark]: Toolchain (without parser) took 245282.39 ms. Allocated memory was 145.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 99.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,267 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1139.56 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 98.9 MB in the beginning and 123.3 MB in the end (delta: -24.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.29 ms. Allocated memory is still 201.9 MB. Free memory was 122.6 MB in the beginning and 119.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,268 INFO L168 Benchmark]: Boogie Preprocessor took 58.01 ms. Allocated memory is still 201.9 MB. Free memory was 119.8 MB in the beginning and 117.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,268 INFO L168 Benchmark]: RCFGBuilder took 683.80 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 117.8 MB in the beginning and 195.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,269 INFO L168 Benchmark]: TraceAbstraction took 243306.53 ms. Allocated memory was 235.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 194.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 04:35:09,274 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1139.56 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 98.9 MB in the beginning and 123.3 MB in the end (delta: -24.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.29 ms. Allocated memory is still 201.9 MB. Free memory was 122.6 MB in the beginning and 119.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.01 ms. Allocated memory is still 201.9 MB. Free memory was 119.8 MB in the beginning and 117.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 683.80 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 117.8 MB in the beginning and 195.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243306.53 ms. Allocated memory was 235.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 194.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 6 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 118 SemBasedMoverChecksPositive, 118 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 20924 CheckedPairsTotal, 153 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (10923states) and FLOYD_HOARE automaton (currently 18 states, 19 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (10923states) and FLOYD_HOARE automaton (currently 18 states, 19 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (10923states) and FLOYD_HOARE automaton (currently 18 states, 19 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (10923states) and FLOYD_HOARE automaton (currently 18 states, 19 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 243.0s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 200.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3448 SDtfs, 15073 SDslu, 17145 SDs, 0 SdLazy, 94801 SolverSat, 1576 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 97.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1531 GetRequests, 30 SyntacticMatches, 42 SemanticMatches, 1458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9069 ImplicationChecksByTransitivity, 112.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11162occurred in iteration=39, 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, 46 MinimizatonAttempts, 110581 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 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