/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:28:20,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:28:20,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:28:20,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:28:20,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:28:20,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:28:20,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:28:20,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:28:20,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:28:20,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:28:20,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:28:20,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:28:20,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:28:20,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:28:20,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:28:20,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:28:20,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:28:20,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:28:20,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:28:20,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:28:20,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:28:20,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:28:20,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:28:20,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:28:20,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:28:20,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:28:20,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:28:20,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:28:20,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:28:20,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:28:20,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:28:20,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:28:20,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:28:20,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:28:20,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:28:20,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:28:20,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:28:20,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:28:20,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:28:20,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:28:20,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:28:20,208 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-VariableLbe.epf [2019-12-27 08:28:20,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:28:20,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:28:20,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:28:20,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:28:20,234 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:28:20,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:28:20,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:28:20,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:28:20,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:28:20,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:28:20,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:28:20,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:28:20,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:28:20,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:28:20,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:28:20,238 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:28:20,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:28:20,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:28:20,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:28:20,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:28:20,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:28:20,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:28:20,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:28:20,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:28:20,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:28:20,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:28:20,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:28:20,240 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:28:20,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:28:20,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:28:20,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:28:20,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:28:20,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:28:20,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:28:20,584 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:28:20,585 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 08:28:20,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b5455a/799e24a5ee434d908155ad70cbdde1f8/FLAGe0ee5f01f [2019-12-27 08:28:21,249 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:28:21,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 08:28:21,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b5455a/799e24a5ee434d908155ad70cbdde1f8/FLAGe0ee5f01f [2019-12-27 08:28:21,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b5455a/799e24a5ee434d908155ad70cbdde1f8 [2019-12-27 08:28:21,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:28:21,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:28:21,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:28:21,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:28:21,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:28:21,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:28:21" (1/1) ... [2019-12-27 08:28:21,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b0b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:21, skipping insertion in model container [2019-12-27 08:28:21,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:28:21" (1/1) ... [2019-12-27 08:28:21,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:28:21,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:28:21,812 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 08:28:22,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:28:22,361 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:28:22,385 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 08:28:22,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:28:22,634 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:28:22,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22 WrapperNode [2019-12-27 08:28:22,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:28:22,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:28:22,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:28:22,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:28:22,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:28:22,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:28:22,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:28:22,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:28:22,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (1/1) ... [2019-12-27 08:28:22,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:28:22,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:28:22,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:28:22,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:28:22,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (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 08:28:22,814 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-27 08:28:22,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-27 08:28:22,814 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-27 08:28:22,815 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-27 08:28:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:28:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:28:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 08:28:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:28:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 08:28:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:28:22,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:28:22,818 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 08:28:23,453 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:28:23,453 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-27 08:28:23,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:28:23 BoogieIcfgContainer [2019-12-27 08:28:23,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:28:23,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:28:23,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:28:23,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:28:23,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:28:21" (1/3) ... [2019-12-27 08:28:23,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659ef1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:28:23, skipping insertion in model container [2019-12-27 08:28:23,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:28:22" (2/3) ... [2019-12-27 08:28:23,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659ef1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:28:23, skipping insertion in model container [2019-12-27 08:28:23,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:28:23" (3/3) ... [2019-12-27 08:28:23,464 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-27 08:28:23,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:28:23,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:28:23,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-27 08:28:23,483 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:28:23,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,534 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,534 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,535 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,538 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,538 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,538 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 08:28:23,539 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 08:28:23,540 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,541 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,542 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,542 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,542 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 08:28:23,542 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 08:28:23,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,543 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,544 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,544 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,546 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,546 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,546 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,547 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,547 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 08:28:23,547 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 08:28:23,548 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,549 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,549 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,550 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 08:28:23,550 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 08:28:23,550 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,550 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,552 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,552 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,553 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,553 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,554 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,554 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,554 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,554 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,554 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,555 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,555 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,555 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,555 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,561 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,562 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,562 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,563 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,570 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,570 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,573 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,574 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,574 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,574 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,574 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,574 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,575 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,575 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,575 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,575 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,575 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,576 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,576 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,576 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,577 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,577 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,577 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,577 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,578 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,579 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,586 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,587 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,587 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,587 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,587 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,587 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,588 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,588 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,588 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,588 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,588 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,589 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,589 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,589 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,589 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,589 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,589 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 08:28:23,590 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 08:28:23,590 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,591 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,592 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,592 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,592 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,592 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,592 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,592 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,593 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 08:28:23,593 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 08:28:23,593 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,593 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,593 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,593 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,594 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,594 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,594 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,594 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,594 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,595 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,595 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,595 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,595 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,595 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,595 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,596 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,596 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,596 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,596 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,596 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,596 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,597 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,597 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,598 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,599 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,599 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,599 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,599 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,599 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,599 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,600 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,600 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,604 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,604 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,611 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,612 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,612 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,613 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,617 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,617 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 08:28:23,617 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,617 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,617 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 08:28:23,619 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,626 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,626 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,626 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,626 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,626 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,627 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,627 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,628 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 08:28:23,628 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,628 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 08:28:23,628 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,628 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,628 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,629 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,629 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,629 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,629 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 08:28:23,630 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,630 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,630 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,630 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,631 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,631 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,631 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 08:28:23,631 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,632 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,633 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,633 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,633 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,633 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:28:23,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-27 08:28:23,679 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:28:23,679 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:28:23,680 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:28:23,680 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:28:23,680 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:28:23,680 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:28:23,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:28:23,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:28:23,708 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-27 08:28:23,709 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 08:28:23,810 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 08:28:23,810 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 08:28:23,825 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 08:28:23,844 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 08:28:23,895 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 08:28:23,895 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 08:28:23,902 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 08:28:23,921 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-27 08:28:23,923 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:28:27,022 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-27 08:28:27,435 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20948 [2019-12-27 08:28:27,435 INFO L214 etLargeBlockEncoding]: Total number of compositions: 149 [2019-12-27 08:28:27,438 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-27 08:28:27,536 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-27 08:28:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-27 08:28:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:28:27,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:27,559 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 08:28:27,559 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 08:28:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash -335056581, now seen corresponding path program 1 times [2019-12-27 08:28:27,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:27,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918157064] [2019-12-27 08:28:27,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:27,922 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 08:28:27,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918157064] [2019-12-27 08:28:27,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:27,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:28:27,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955142333] [2019-12-27 08:28:27,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:28:27,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:28:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:28:27,949 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-27 08:28:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:28,394 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-27 08:28:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:28:28,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 08:28:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:28,435 INFO L225 Difference]: With dead ends: 2169 [2019-12-27 08:28:28,435 INFO L226 Difference]: Without dead ends: 2053 [2019-12-27 08:28:28,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:28:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-27 08:28:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-27 08:28:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-27 08:28:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-27 08:28:28,580 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-27 08:28:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:28,580 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-27 08:28:28,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:28:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-27 08:28:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:28,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:28,584 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 08:28:28,584 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 08:28:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash 297867655, now seen corresponding path program 1 times [2019-12-27 08:28:28,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:28,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148598125] [2019-12-27 08:28:28,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:28,771 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 08:28:28,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148598125] [2019-12-27 08:28:28,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:28,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:28:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122786736] [2019-12-27 08:28:28,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:28:28,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:28:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:28:28,774 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-27 08:28:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:29,427 INFO L93 Difference]: Finished difference Result 3627 states and 11998 transitions. [2019-12-27 08:28:29,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:28:29,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 08:28:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:29,456 INFO L225 Difference]: With dead ends: 3627 [2019-12-27 08:28:29,457 INFO L226 Difference]: Without dead ends: 3587 [2019-12-27 08:28:29,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:28:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2019-12-27 08:28:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 2596. [2019-12-27 08:28:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2596 states. [2019-12-27 08:28:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 8468 transitions. [2019-12-27 08:28:29,640 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 8468 transitions. Word has length 18 [2019-12-27 08:28:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:29,641 INFO L462 AbstractCegarLoop]: Abstraction has 2596 states and 8468 transitions. [2019-12-27 08:28:29,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:28:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 8468 transitions. [2019-12-27 08:28:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:28:29,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:29,645 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 08:28:29,646 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 08:28:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -100749885, now seen corresponding path program 2 times [2019-12-27 08:28:29,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:29,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011683800] [2019-12-27 08:28:29,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:29,851 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 08:28:29,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011683800] [2019-12-27 08:28:29,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:29,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:28:29,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533009737] [2019-12-27 08:28:29,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:28:29,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:29,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:28:29,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:28:29,854 INFO L87 Difference]: Start difference. First operand 2596 states and 8468 transitions. Second operand 7 states. [2019-12-27 08:28:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:30,323 INFO L93 Difference]: Finished difference Result 3131 states and 10150 transitions. [2019-12-27 08:28:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:28:30,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 08:28:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:30,345 INFO L225 Difference]: With dead ends: 3131 [2019-12-27 08:28:30,345 INFO L226 Difference]: Without dead ends: 3083 [2019-12-27 08:28:30,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:28:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-12-27 08:28:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2544. [2019-12-27 08:28:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-27 08:28:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-27 08:28:30,427 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-27 08:28:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:30,427 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-27 08:28:30,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:28:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-27 08:28:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:30,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:30,433 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 08:28:30,433 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 08:28:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1794084954, now seen corresponding path program 1 times [2019-12-27 08:28:30,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:30,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523735927] [2019-12-27 08:28:30,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:31,053 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-12-27 08:28:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:31,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523735927] [2019-12-27 08:28:31,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:31,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:28:31,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580974559] [2019-12-27 08:28:31,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:28:31,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:28:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:28:31,062 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 12 states. [2019-12-27 08:28:31,789 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-27 08:28:32,770 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-27 08:28:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:33,019 INFO L93 Difference]: Finished difference Result 3094 states and 10016 transitions. [2019-12-27 08:28:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:28:33,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 08:28:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:33,041 INFO L225 Difference]: With dead ends: 3094 [2019-12-27 08:28:33,041 INFO L226 Difference]: Without dead ends: 3094 [2019-12-27 08:28:33,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-27 08:28:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2019-12-27 08:28:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3034. [2019-12-27 08:28:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-27 08:28:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9886 transitions. [2019-12-27 08:28:33,129 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9886 transitions. Word has length 25 [2019-12-27 08:28:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:33,131 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 9886 transitions. [2019-12-27 08:28:33,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:28:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9886 transitions. [2019-12-27 08:28:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:33,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:33,138 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 08:28:33,138 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 08:28:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 683365392, now seen corresponding path program 1 times [2019-12-27 08:28:33,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:33,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370557648] [2019-12-27 08:28:33,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:33,734 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 08:28:33,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370557648] [2019-12-27 08:28:33,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:33,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:33,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229482637] [2019-12-27 08:28:33,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:28:33,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:33,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:28:33,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:28:33,737 INFO L87 Difference]: Start difference. First operand 3034 states and 9886 transitions. Second operand 14 states. [2019-12-27 08:28:35,775 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-27 08:28:36,059 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 08:28:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:36,384 INFO L93 Difference]: Finished difference Result 3654 states and 11766 transitions. [2019-12-27 08:28:36,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:28:36,384 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 08:28:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:36,409 INFO L225 Difference]: With dead ends: 3654 [2019-12-27 08:28:36,409 INFO L226 Difference]: Without dead ends: 3654 [2019-12-27 08:28:36,410 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 08:28:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-27 08:28:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-27 08:28:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-27 08:28:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-27 08:28:36,573 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-27 08:28:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:36,573 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-27 08:28:36,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:28:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-27 08:28:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:36,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:36,582 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 08:28:36,583 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 08:28:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 557439904, now seen corresponding path program 2 times [2019-12-27 08:28:36,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:36,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327108198] [2019-12-27 08:28:36,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:37,209 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 08:28:37,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327108198] [2019-12-27 08:28:37,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:37,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:28:37,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388532132] [2019-12-27 08:28:37,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:28:37,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:28:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:28:37,211 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 13 states. [2019-12-27 08:28:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:40,815 INFO L93 Difference]: Finished difference Result 4574 states and 14569 transitions. [2019-12-27 08:28:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 08:28:40,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 08:28:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:40,834 INFO L225 Difference]: With dead ends: 4574 [2019-12-27 08:28:40,834 INFO L226 Difference]: Without dead ends: 4574 [2019-12-27 08:28:40,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2019-12-27 08:28:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-12-27 08:28:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 3594. [2019-12-27 08:28:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-27 08:28:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11569 transitions. [2019-12-27 08:28:40,941 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11569 transitions. Word has length 25 [2019-12-27 08:28:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:40,941 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11569 transitions. [2019-12-27 08:28:40,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:28:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11569 transitions. [2019-12-27 08:28:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:40,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:40,949 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 08:28:40,949 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 08:28:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash -963117732, now seen corresponding path program 3 times [2019-12-27 08:28:40,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:40,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702062954] [2019-12-27 08:28:40,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:41,314 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2019-12-27 08:28:41,385 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 08:28:41,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702062954] [2019-12-27 08:28:41,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:41,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:28:41,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126001418] [2019-12-27 08:28:41,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:28:41,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:28:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:28:41,388 INFO L87 Difference]: Start difference. First operand 3594 states and 11569 transitions. Second operand 12 states. [2019-12-27 08:28:43,501 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-27 08:28:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:43,776 INFO L93 Difference]: Finished difference Result 4378 states and 13953 transitions. [2019-12-27 08:28:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:28:43,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 08:28:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:43,792 INFO L225 Difference]: With dead ends: 4378 [2019-12-27 08:28:43,792 INFO L226 Difference]: Without dead ends: 4378 [2019-12-27 08:28:43,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-27 08:28:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2019-12-27 08:28:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 3258. [2019-12-27 08:28:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3258 states. [2019-12-27 08:28:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 10453 transitions. [2019-12-27 08:28:43,903 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 10453 transitions. Word has length 25 [2019-12-27 08:28:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:43,904 INFO L462 AbstractCegarLoop]: Abstraction has 3258 states and 10453 transitions. [2019-12-27 08:28:43,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:28:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 10453 transitions. [2019-12-27 08:28:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:43,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:43,911 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 08:28:43,911 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 08:28:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2139201454, now seen corresponding path program 2 times [2019-12-27 08:28:43,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:43,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825461194] [2019-12-27 08:28:43,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:44,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825461194] [2019-12-27 08:28:44,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:44,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:44,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662945102] [2019-12-27 08:28:44,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:28:44,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:44,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:28:44,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:28:44,559 INFO L87 Difference]: Start difference. First operand 3258 states and 10453 transitions. Second operand 14 states. [2019-12-27 08:28:47,217 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-27 08:28:47,523 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-27 08:28:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:47,938 INFO L93 Difference]: Finished difference Result 4358 states and 13703 transitions. [2019-12-27 08:28:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:28:47,938 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 08:28:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:47,952 INFO L225 Difference]: With dead ends: 4358 [2019-12-27 08:28:47,952 INFO L226 Difference]: Without dead ends: 4358 [2019-12-27 08:28:47,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:28:47,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2019-12-27 08:28:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 3188. [2019-12-27 08:28:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-27 08:28:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-27 08:28:48,044 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-27 08:28:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:48,044 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-27 08:28:48,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:28:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-27 08:28:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:48,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:48,051 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 08:28:48,051 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 08:28:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash 822898226, now seen corresponding path program 3 times [2019-12-27 08:28:48,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:48,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777423840] [2019-12-27 08:28:48,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:48,555 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 08:28:48,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777423840] [2019-12-27 08:28:48,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:48,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:48,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717477157] [2019-12-27 08:28:48,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:28:48,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:48,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:28:48,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:28:48,557 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 14 states. [2019-12-27 08:28:51,220 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-27 08:28:51,513 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-27 08:28:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:51,843 INFO L93 Difference]: Finished difference Result 4158 states and 13103 transitions. [2019-12-27 08:28:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:28:51,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 08:28:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:51,856 INFO L225 Difference]: With dead ends: 4158 [2019-12-27 08:28:51,857 INFO L226 Difference]: Without dead ends: 4158 [2019-12-27 08:28:51,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-27 08:28:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2019-12-27 08:28:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3118. [2019-12-27 08:28:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-12-27 08:28:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 9973 transitions. [2019-12-27 08:28:51,941 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 9973 transitions. Word has length 25 [2019-12-27 08:28:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:51,941 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 9973 transitions. [2019-12-27 08:28:51,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:28:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 9973 transitions. [2019-12-27 08:28:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:28:51,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:51,947 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 08:28:51,947 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 08:28:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1855082980, now seen corresponding path program 4 times [2019-12-27 08:28:51,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:51,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454687897] [2019-12-27 08:28:51,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:52,453 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 08:28:52,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454687897] [2019-12-27 08:28:52,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:52,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:28:52,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041881814] [2019-12-27 08:28:52,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:28:52,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:28:52,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:28:52,455 INFO L87 Difference]: Start difference. First operand 3118 states and 9973 transitions. Second operand 14 states. [2019-12-27 08:28:53,155 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-12-27 08:28:55,642 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-27 08:28:55,920 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-12-27 08:28:56,089 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 08:28:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:56,476 INFO L93 Difference]: Finished difference Result 4042 states and 12710 transitions. [2019-12-27 08:28:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 08:28:56,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 08:28:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:56,486 INFO L225 Difference]: With dead ends: 4042 [2019-12-27 08:28:56,486 INFO L226 Difference]: Without dead ends: 4042 [2019-12-27 08:28:56,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 08:28:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4042 states. [2019-12-27 08:28:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4042 to 2852. [2019-12-27 08:28:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-27 08:28:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-27 08:28:56,566 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-27 08:28:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:56,566 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-27 08:28:56,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:28:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-27 08:28:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:28:56,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:56,573 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 08:28:56,573 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 08:28:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash -753361541, now seen corresponding path program 1 times [2019-12-27 08:28:56,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:56,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936938468] [2019-12-27 08:28:56,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:28:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:28:57,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936938468] [2019-12-27 08:28:57,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:28:57,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:28:57,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455407695] [2019-12-27 08:28:57,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:28:57,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:28:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:28:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:28:57,224 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 14 states. [2019-12-27 08:28:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:28:59,407 INFO L93 Difference]: Finished difference Result 4947 states and 15922 transitions. [2019-12-27 08:28:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:28:59,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-27 08:28:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:28:59,421 INFO L225 Difference]: With dead ends: 4947 [2019-12-27 08:28:59,421 INFO L226 Difference]: Without dead ends: 4947 [2019-12-27 08:28:59,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:28:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-12-27 08:28:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4032. [2019-12-27 08:28:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-12-27 08:28:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 12853 transitions. [2019-12-27 08:28:59,523 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 12853 transitions. Word has length 27 [2019-12-27 08:28:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:28:59,524 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 12853 transitions. [2019-12-27 08:28:59,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:28:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 12853 transitions. [2019-12-27 08:28:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:28:59,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:28:59,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:28:59,531 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 08:28:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:28:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash -798819684, now seen corresponding path program 1 times [2019-12-27 08:28:59,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:28:59,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526612444] [2019-12-27 08:28:59,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:28:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:00,036 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-12-27 08:29:00,268 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-27 08:29:00,382 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 08:29:00,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526612444] [2019-12-27 08:29:00,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:00,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:00,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375218290] [2019-12-27 08:29:00,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:00,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:00,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:00,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:00,384 INFO L87 Difference]: Start difference. First operand 4032 states and 12853 transitions. Second operand 16 states. [2019-12-27 08:29:01,458 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-12-27 08:29:01,744 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-27 08:29:02,042 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-27 08:29:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:03,469 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-27 08:29:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:29:03,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:03,480 INFO L225 Difference]: With dead ends: 6137 [2019-12-27 08:29:03,481 INFO L226 Difference]: Without dead ends: 6137 [2019-12-27 08:29:03,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:29:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-27 08:29:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-27 08:29:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-27 08:29:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-27 08:29:03,602 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-27 08:29:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:03,603 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-27 08:29:03,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-27 08:29:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:03,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:03,611 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 08:29:03,611 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 08:29:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash 536686401, now seen corresponding path program 2 times [2019-12-27 08:29:03,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:03,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152476330] [2019-12-27 08:29:03,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:04,216 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2019-12-27 08:29:04,517 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 08:29:04,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152476330] [2019-12-27 08:29:04,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:04,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031468723] [2019-12-27 08:29:04,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:04,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:04,520 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 16 states. [2019-12-27 08:29:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:07,607 INFO L93 Difference]: Finished difference Result 6649 states and 21281 transitions. [2019-12-27 08:29:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:29:07,607 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:07,617 INFO L225 Difference]: With dead ends: 6649 [2019-12-27 08:29:07,618 INFO L226 Difference]: Without dead ends: 6649 [2019-12-27 08:29:07,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:29:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6649 states. [2019-12-27 08:29:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6649 to 4554. [2019-12-27 08:29:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2019-12-27 08:29:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 14459 transitions. [2019-12-27 08:29:07,732 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 14459 transitions. Word has length 27 [2019-12-27 08:29:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:07,732 INFO L462 AbstractCegarLoop]: Abstraction has 4554 states and 14459 transitions. [2019-12-27 08:29:07,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 14459 transitions. [2019-12-27 08:29:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:07,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:07,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:29:07,741 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 08:29:07,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash -430321155, now seen corresponding path program 3 times [2019-12-27 08:29:07,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:07,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000309980] [2019-12-27 08:29:07,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:08,433 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 08:29:08,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000309980] [2019-12-27 08:29:08,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:08,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:29:08,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692488594] [2019-12-27 08:29:08,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:29:08,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:29:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:29:08,435 INFO L87 Difference]: Start difference. First operand 4554 states and 14459 transitions. Second operand 15 states. [2019-12-27 08:29:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:11,446 INFO L93 Difference]: Finished difference Result 6369 states and 20451 transitions. [2019-12-27 08:29:11,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:29:11,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 08:29:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:11,456 INFO L225 Difference]: With dead ends: 6369 [2019-12-27 08:29:11,456 INFO L226 Difference]: Without dead ends: 6369 [2019-12-27 08:29:11,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:29:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2019-12-27 08:29:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 4554. [2019-12-27 08:29:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2019-12-27 08:29:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 14459 transitions. [2019-12-27 08:29:11,582 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 14459 transitions. Word has length 27 [2019-12-27 08:29:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:11,582 INFO L462 AbstractCegarLoop]: Abstraction has 4554 states and 14459 transitions. [2019-12-27 08:29:11,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:29:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 14459 transitions. [2019-12-27 08:29:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:11,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:11,594 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 08:29:11,595 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 08:29:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1215770469, now seen corresponding path program 4 times [2019-12-27 08:29:11,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:11,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547401812] [2019-12-27 08:29:11,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:12,103 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-12-27 08:29:12,352 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 08:29:12,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547401812] [2019-12-27 08:29:12,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:12,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:29:12,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041176149] [2019-12-27 08:29:12,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:29:12,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:29:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:29:12,354 INFO L87 Difference]: Start difference. First operand 4554 states and 14459 transitions. Second operand 15 states. [2019-12-27 08:29:13,620 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-12-27 08:29:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:15,747 INFO L93 Difference]: Finished difference Result 8387 states and 27219 transitions. [2019-12-27 08:29:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:29:15,748 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 08:29:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:15,761 INFO L225 Difference]: With dead ends: 8387 [2019-12-27 08:29:15,761 INFO L226 Difference]: Without dead ends: 8387 [2019-12-27 08:29:15,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:29:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8387 states. [2019-12-27 08:29:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8387 to 5289. [2019-12-27 08:29:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5289 states. [2019-12-27 08:29:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 16942 transitions. [2019-12-27 08:29:15,906 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 16942 transitions. Word has length 27 [2019-12-27 08:29:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:15,906 INFO L462 AbstractCegarLoop]: Abstraction has 5289 states and 16942 transitions. [2019-12-27 08:29:15,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:29:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 16942 transitions. [2019-12-27 08:29:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:15,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:15,918 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 08:29:15,918 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 08:29:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1215770468, now seen corresponding path program 1 times [2019-12-27 08:29:15,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:15,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435945385] [2019-12-27 08:29:15,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:16,629 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 08:29:16,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435945385] [2019-12-27 08:29:16,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:16,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:29:16,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196130920] [2019-12-27 08:29:16,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:29:16,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:29:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:29:16,633 INFO L87 Difference]: Start difference. First operand 5289 states and 16942 transitions. Second operand 15 states. [2019-12-27 08:29:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:20,028 INFO L93 Difference]: Finished difference Result 8312 states and 26935 transitions. [2019-12-27 08:29:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:29:20,028 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 08:29:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:20,041 INFO L225 Difference]: With dead ends: 8312 [2019-12-27 08:29:20,041 INFO L226 Difference]: Without dead ends: 8312 [2019-12-27 08:29:20,044 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 08:29:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8312 states. [2019-12-27 08:29:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8312 to 4599. [2019-12-27 08:29:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-27 08:29:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 14604 transitions. [2019-12-27 08:29:20,190 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 14604 transitions. Word has length 27 [2019-12-27 08:29:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:20,190 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 14604 transitions. [2019-12-27 08:29:20,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:29:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 14604 transitions. [2019-12-27 08:29:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:20,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:20,200 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 08:29:20,200 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 08:29:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash 111879065, now seen corresponding path program 5 times [2019-12-27 08:29:20,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:20,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034280167] [2019-12-27 08:29:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:20,770 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-12-27 08:29:20,964 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 08:29:20,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034280167] [2019-12-27 08:29:20,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:20,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:29:20,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863040825] [2019-12-27 08:29:20,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:29:20,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:29:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:29:20,971 INFO L87 Difference]: Start difference. First operand 4599 states and 14604 transitions. Second operand 15 states. [2019-12-27 08:29:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:24,063 INFO L93 Difference]: Finished difference Result 6414 states and 20586 transitions. [2019-12-27 08:29:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:29:24,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 08:29:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:24,075 INFO L225 Difference]: With dead ends: 6414 [2019-12-27 08:29:24,075 INFO L226 Difference]: Without dead ends: 6414 [2019-12-27 08:29:24,076 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 08:29:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2019-12-27 08:29:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 4599. [2019-12-27 08:29:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-27 08:29:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 14604 transitions. [2019-12-27 08:29:24,173 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 14604 transitions. Word has length 27 [2019-12-27 08:29:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:24,173 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 14604 transitions. [2019-12-27 08:29:24,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:29:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 14604 transitions. [2019-12-27 08:29:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:24,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:24,182 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 08:29:24,182 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 08:29:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash 749167323, now seen corresponding path program 6 times [2019-12-27 08:29:24,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:24,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354663339] [2019-12-27 08:29:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:24,646 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-27 08:29:24,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 08:29:24,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354663339] [2019-12-27 08:29:24,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:24,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:29:24,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205748375] [2019-12-27 08:29:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:29:24,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:29:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:29:24,979 INFO L87 Difference]: Start difference. First operand 4599 states and 14604 transitions. Second operand 15 states. [2019-12-27 08:29:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:27,546 INFO L93 Difference]: Finished difference Result 6484 states and 20896 transitions. [2019-12-27 08:29:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:29:27,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 08:29:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:27,556 INFO L225 Difference]: With dead ends: 6484 [2019-12-27 08:29:27,556 INFO L226 Difference]: Without dead ends: 6484 [2019-12-27 08:29:27,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:29:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-12-27 08:29:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 5289. [2019-12-27 08:29:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5289 states. [2019-12-27 08:29:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 16942 transitions. [2019-12-27 08:29:27,642 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 16942 transitions. Word has length 27 [2019-12-27 08:29:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:27,642 INFO L462 AbstractCegarLoop]: Abstraction has 5289 states and 16942 transitions. [2019-12-27 08:29:27,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:29:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 16942 transitions. [2019-12-27 08:29:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:27,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:27,651 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 08:29:27,651 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 08:29:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash 749167324, now seen corresponding path program 2 times [2019-12-27 08:29:27,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:27,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559284312] [2019-12-27 08:29:27,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:28,304 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 08:29:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559284312] [2019-12-27 08:29:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 08:29:28,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121631812] [2019-12-27 08:29:28,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:29:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:29:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:29:28,306 INFO L87 Difference]: Start difference. First operand 5289 states and 16942 transitions. Second operand 15 states. [2019-12-27 08:29:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:31,206 INFO L93 Difference]: Finished difference Result 6484 states and 20776 transitions. [2019-12-27 08:29:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:29:31,207 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 08:29:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:31,216 INFO L225 Difference]: With dead ends: 6484 [2019-12-27 08:29:31,217 INFO L226 Difference]: Without dead ends: 6484 [2019-12-27 08:29:31,217 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 08:29:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-12-27 08:29:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 4109. [2019-12-27 08:29:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-12-27 08:29:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 13114 transitions. [2019-12-27 08:29:31,362 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 13114 transitions. Word has length 27 [2019-12-27 08:29:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:31,362 INFO L462 AbstractCegarLoop]: Abstraction has 4109 states and 13114 transitions. [2019-12-27 08:29:31,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:29:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 13114 transitions. [2019-12-27 08:29:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:31,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:31,367 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 08:29:31,367 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 08:29:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:31,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1133772382, now seen corresponding path program 2 times [2019-12-27 08:29:31,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:31,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402535616] [2019-12-27 08:29:31,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:31,826 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2019-12-27 08:29:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:29:32,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402535616] [2019-12-27 08:29:32,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:32,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:32,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276610397] [2019-12-27 08:29:32,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:32,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:32,049 INFO L87 Difference]: Start difference. First operand 4109 states and 13114 transitions. Second operand 16 states. [2019-12-27 08:29:33,125 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-12-27 08:29:33,396 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-27 08:29:33,688 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-27 08:29:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:35,288 INFO L93 Difference]: Finished difference Result 6154 states and 19786 transitions. [2019-12-27 08:29:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:29:35,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:35,299 INFO L225 Difference]: With dead ends: 6154 [2019-12-27 08:29:35,299 INFO L226 Difference]: Without dead ends: 6154 [2019-12-27 08:29:35,299 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 08:29:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2019-12-27 08:29:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 4049. [2019-12-27 08:29:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-27 08:29:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12934 transitions. [2019-12-27 08:29:35,367 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12934 transitions. Word has length 27 [2019-12-27 08:29:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:35,367 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12934 transitions. [2019-12-27 08:29:35,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12934 transitions. [2019-12-27 08:29:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:35,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:35,372 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 08:29:35,372 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 08:29:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash 148247614, now seen corresponding path program 3 times [2019-12-27 08:29:35,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:35,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249984789] [2019-12-27 08:29:35,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:35,831 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2019-12-27 08:29:36,110 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 08:29:36,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249984789] [2019-12-27 08:29:36,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:36,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:36,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860929407] [2019-12-27 08:29:36,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:36,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:36,112 INFO L87 Difference]: Start difference. First operand 4049 states and 12934 transitions. Second operand 16 states. [2019-12-27 08:29:37,458 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-27 08:29:37,761 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-27 08:29:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:39,308 INFO L93 Difference]: Finished difference Result 5968 states and 19228 transitions. [2019-12-27 08:29:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:29:39,309 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:39,317 INFO L225 Difference]: With dead ends: 5968 [2019-12-27 08:29:39,318 INFO L226 Difference]: Without dead ends: 5968 [2019-12-27 08:29:39,318 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 08:29:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2019-12-27 08:29:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3923. [2019-12-27 08:29:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-27 08:29:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12556 transitions. [2019-12-27 08:29:39,376 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12556 transitions. Word has length 27 [2019-12-27 08:29:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:39,376 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 12556 transitions. [2019-12-27 08:29:39,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12556 transitions. [2019-12-27 08:29:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:39,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:39,381 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 08:29:39,381 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 08:29:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash -59649168, now seen corresponding path program 4 times [2019-12-27 08:29:39,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:39,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941350312] [2019-12-27 08:29:39,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:40,145 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 08:29:40,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941350312] [2019-12-27 08:29:40,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:40,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:40,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271798013] [2019-12-27 08:29:40,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:40,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:40,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:40,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:40,146 INFO L87 Difference]: Start difference. First operand 3923 states and 12556 transitions. Second operand 16 states. [2019-12-27 08:29:41,181 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-27 08:29:41,452 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-12-27 08:29:41,742 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-27 08:29:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:43,425 INFO L93 Difference]: Finished difference Result 5873 states and 19012 transitions. [2019-12-27 08:29:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:29:43,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:43,441 INFO L225 Difference]: With dead ends: 5873 [2019-12-27 08:29:43,441 INFO L226 Difference]: Without dead ends: 5873 [2019-12-27 08:29:43,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:29:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5873 states. [2019-12-27 08:29:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5873 to 4813. [2019-12-27 08:29:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2019-12-27 08:29:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 15514 transitions. [2019-12-27 08:29:43,541 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 15514 transitions. Word has length 27 [2019-12-27 08:29:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:43,542 INFO L462 AbstractCegarLoop]: Abstraction has 4813 states and 15514 transitions. [2019-12-27 08:29:43,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 15514 transitions. [2019-12-27 08:29:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:43,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:43,550 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 08:29:43,550 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 08:29:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -59649167, now seen corresponding path program 1 times [2019-12-27 08:29:43,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:43,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135954792] [2019-12-27 08:29:43,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:43,968 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2019-12-27 08:29:44,289 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 08:29:44,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135954792] [2019-12-27 08:29:44,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:44,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:44,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789361861] [2019-12-27 08:29:44,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:44,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:44,290 INFO L87 Difference]: Start difference. First operand 4813 states and 15514 transitions. Second operand 16 states. [2019-12-27 08:29:45,871 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 08:29:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:47,659 INFO L93 Difference]: Finished difference Result 5798 states and 18728 transitions. [2019-12-27 08:29:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:29:47,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:47,668 INFO L225 Difference]: With dead ends: 5798 [2019-12-27 08:29:47,668 INFO L226 Difference]: Without dead ends: 5798 [2019-12-27 08:29:47,669 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 08:29:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5798 states. [2019-12-27 08:29:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5798 to 3923. [2019-12-27 08:29:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-27 08:29:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12556 transitions. [2019-12-27 08:29:47,729 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12556 transitions. Word has length 27 [2019-12-27 08:29:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:47,729 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 12556 transitions. [2019-12-27 08:29:47,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12556 transitions. [2019-12-27 08:29:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:47,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:47,734 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 08:29:47,734 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 08:29:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1875030286, now seen corresponding path program 5 times [2019-12-27 08:29:47,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:47,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175784968] [2019-12-27 08:29:47,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:48,389 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 08:29:48,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175784968] [2019-12-27 08:29:48,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:48,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:48,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196869715] [2019-12-27 08:29:48,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:48,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:48,391 INFO L87 Difference]: Start difference. First operand 3923 states and 12556 transitions. Second operand 16 states. [2019-12-27 08:29:49,663 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-27 08:29:50,049 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 08:29:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:51,990 INFO L93 Difference]: Finished difference Result 5738 states and 18668 transitions. [2019-12-27 08:29:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:29:51,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:52,036 INFO L225 Difference]: With dead ends: 5738 [2019-12-27 08:29:52,037 INFO L226 Difference]: Without dead ends: 5738 [2019-12-27 08:29:52,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:29:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2019-12-27 08:29:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 4753. [2019-12-27 08:29:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4753 states. [2019-12-27 08:29:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 15334 transitions. [2019-12-27 08:29:52,096 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 15334 transitions. Word has length 27 [2019-12-27 08:29:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:52,096 INFO L462 AbstractCegarLoop]: Abstraction has 4753 states and 15334 transitions. [2019-12-27 08:29:52,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 15334 transitions. [2019-12-27 08:29:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:52,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:52,103 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 08:29:52,103 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 08:29:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1875030287, now seen corresponding path program 2 times [2019-12-27 08:29:52,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:52,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643242904] [2019-12-27 08:29:52,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:52,541 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-12-27 08:29:52,849 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 08:29:52,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643242904] [2019-12-27 08:29:52,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:52,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:52,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265151108] [2019-12-27 08:29:52,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:52,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:52,851 INFO L87 Difference]: Start difference. First operand 4753 states and 15334 transitions. Second operand 16 states. [2019-12-27 08:29:54,079 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 08:29:54,452 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-27 08:29:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:29:56,291 INFO L93 Difference]: Finished difference Result 5738 states and 18548 transitions. [2019-12-27 08:29:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:29:56,292 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:29:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:29:56,301 INFO L225 Difference]: With dead ends: 5738 [2019-12-27 08:29:56,301 INFO L226 Difference]: Without dead ends: 5738 [2019-12-27 08:29:56,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:29:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2019-12-27 08:29:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 3923. [2019-12-27 08:29:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-27 08:29:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12556 transitions. [2019-12-27 08:29:56,364 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12556 transitions. Word has length 27 [2019-12-27 08:29:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:29:56,364 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 12556 transitions. [2019-12-27 08:29:56,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:29:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12556 transitions. [2019-12-27 08:29:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:29:56,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:29:56,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:29:56,368 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 08:29:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:29:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1352221194, now seen corresponding path program 6 times [2019-12-27 08:29:56,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:29:56,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103271368] [2019-12-27 08:29:56,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:29:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:29:56,815 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-12-27 08:29:57,005 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-12-27 08:29:57,108 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 08:29:57,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103271368] [2019-12-27 08:29:57,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:29:57,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:29:57,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447640288] [2019-12-27 08:29:57,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:29:57,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:29:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:29:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:29:57,110 INFO L87 Difference]: Start difference. First operand 3923 states and 12556 transitions. Second operand 16 states. [2019-12-27 08:29:58,409 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-27 08:29:58,793 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-27 08:30:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:00,989 INFO L93 Difference]: Finished difference Result 7681 states and 25032 transitions. [2019-12-27 08:30:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:30:00,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:30:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:01,002 INFO L225 Difference]: With dead ends: 7681 [2019-12-27 08:30:01,002 INFO L226 Difference]: Without dead ends: 7681 [2019-12-27 08:30:01,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:30:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7681 states. [2019-12-27 08:30:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7681 to 3929. [2019-12-27 08:30:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-12-27 08:30:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 12575 transitions. [2019-12-27 08:30:01,070 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 12575 transitions. Word has length 27 [2019-12-27 08:30:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:01,071 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 12575 transitions. [2019-12-27 08:30:01,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:30:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 12575 transitions. [2019-12-27 08:30:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:30:01,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:01,074 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 08:30:01,074 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 08:30:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 309537078, now seen corresponding path program 7 times [2019-12-27 08:30:01,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:01,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748374957] [2019-12-27 08:30:01,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:01,805 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 08:30:01,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748374957] [2019-12-27 08:30:01,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:01,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:30:01,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772891175] [2019-12-27 08:30:01,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:30:01,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:30:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:30:01,807 INFO L87 Difference]: Start difference. First operand 3929 states and 12575 transitions. Second operand 16 states. [2019-12-27 08:30:02,469 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-12-27 08:30:02,668 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-12-27 08:30:03,060 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2019-12-27 08:30:03,369 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-27 08:30:03,669 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-27 08:30:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:05,391 INFO L93 Difference]: Finished difference Result 5669 states and 18371 transitions. [2019-12-27 08:30:05,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:30:05,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:30:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:05,399 INFO L225 Difference]: With dead ends: 5669 [2019-12-27 08:30:05,400 INFO L226 Difference]: Without dead ends: 5669 [2019-12-27 08:30:05,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-12-27 08:30:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-12-27 08:30:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4619. [2019-12-27 08:30:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4619 states. [2019-12-27 08:30:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4619 states to 4619 states and 14913 transitions. [2019-12-27 08:30:05,473 INFO L78 Accepts]: Start accepts. Automaton has 4619 states and 14913 transitions. Word has length 27 [2019-12-27 08:30:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:05,473 INFO L462 AbstractCegarLoop]: Abstraction has 4619 states and 14913 transitions. [2019-12-27 08:30:05,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:30:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 14913 transitions. [2019-12-27 08:30:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:30:05,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:05,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:30:05,477 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 08:30:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash 309537079, now seen corresponding path program 3 times [2019-12-27 08:30:05,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:05,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136582709] [2019-12-27 08:30:05,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:30:06,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136582709] [2019-12-27 08:30:06,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:06,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 08:30:06,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155729785] [2019-12-27 08:30:06,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:30:06,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:30:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:30:06,117 INFO L87 Difference]: Start difference. First operand 4619 states and 14913 transitions. Second operand 16 states. [2019-12-27 08:30:07,862 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 08:30:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:09,620 INFO L93 Difference]: Finished difference Result 5594 states and 18087 transitions. [2019-12-27 08:30:09,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:30:09,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 08:30:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:09,631 INFO L225 Difference]: With dead ends: 5594 [2019-12-27 08:30:09,632 INFO L226 Difference]: Without dead ends: 5594 [2019-12-27 08:30:09,632 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 08:30:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2019-12-27 08:30:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 3549. [2019-12-27 08:30:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-27 08:30:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-27 08:30:09,686 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-27 08:30:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:09,686 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-27 08:30:09,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:30:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-27 08:30:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:09,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:09,689 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 08:30:09,690 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 08:30:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2105467465, now seen corresponding path program 1 times [2019-12-27 08:30:09,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:09,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105108154] [2019-12-27 08:30:09,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:10,480 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 08:30:10,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105108154] [2019-12-27 08:30:10,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:10,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 08:30:10,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98918288] [2019-12-27 08:30:10,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:30:10,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:30:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:30:10,482 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 18 states. [2019-12-27 08:30:10,666 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-12-27 08:30:10,901 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-27 08:30:11,093 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-27 08:30:11,326 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-27 08:30:11,675 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-12-27 08:30:11,901 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-27 08:30:12,203 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-12-27 08:30:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:13,951 INFO L93 Difference]: Finished difference Result 7360 states and 24067 transitions. [2019-12-27 08:30:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:30:13,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-27 08:30:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:13,963 INFO L225 Difference]: With dead ends: 7360 [2019-12-27 08:30:13,963 INFO L226 Difference]: Without dead ends: 7360 [2019-12-27 08:30:13,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:30:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-12-27 08:30:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 4754. [2019-12-27 08:30:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4754 states. [2019-12-27 08:30:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 15310 transitions. [2019-12-27 08:30:14,048 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 15310 transitions. Word has length 30 [2019-12-27 08:30:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:14,048 INFO L462 AbstractCegarLoop]: Abstraction has 4754 states and 15310 transitions. [2019-12-27 08:30:14,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:30:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 15310 transitions. [2019-12-27 08:30:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:14,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:14,053 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 08:30:14,053 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 08:30:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash 776627592, now seen corresponding path program 1 times [2019-12-27 08:30:14,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:14,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934721650] [2019-12-27 08:30:14,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:30:14,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934721650] [2019-12-27 08:30:14,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:14,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 08:30:14,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497884048] [2019-12-27 08:30:14,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:30:14,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:30:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:30:14,979 INFO L87 Difference]: Start difference. First operand 4754 states and 15310 transitions. Second operand 19 states. [2019-12-27 08:30:15,359 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-27 08:30:15,579 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-27 08:30:15,863 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-12-27 08:30:16,162 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-12-27 08:30:16,675 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2019-12-27 08:30:17,264 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 75 [2019-12-27 08:30:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:19,739 INFO L93 Difference]: Finished difference Result 8625 states and 28142 transitions. [2019-12-27 08:30:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:30:19,740 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 08:30:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:19,753 INFO L225 Difference]: With dead ends: 8625 [2019-12-27 08:30:19,754 INFO L226 Difference]: Without dead ends: 8625 [2019-12-27 08:30:19,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:30:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2019-12-27 08:30:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 5356. [2019-12-27 08:30:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5356 states. [2019-12-27 08:30:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 17165 transitions. [2019-12-27 08:30:19,830 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 17165 transitions. Word has length 30 [2019-12-27 08:30:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:19,831 INFO L462 AbstractCegarLoop]: Abstraction has 5356 states and 17165 transitions. [2019-12-27 08:30:19,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:30:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 17165 transitions. [2019-12-27 08:30:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:19,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:19,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:30:19,836 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 08:30:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1738624317, now seen corresponding path program 2 times [2019-12-27 08:30:19,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:19,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468217485] [2019-12-27 08:30:19,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:20,034 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 08:30:20,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468217485] [2019-12-27 08:30:20,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:20,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 08:30:20,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449450592] [2019-12-27 08:30:20,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:30:20,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:30:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:30:20,035 INFO L87 Difference]: Start difference. First operand 5356 states and 17165 transitions. Second operand 12 states. [2019-12-27 08:30:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:22,382 INFO L93 Difference]: Finished difference Result 12092 states and 38988 transitions. [2019-12-27 08:30:22,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:30:22,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-27 08:30:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:22,400 INFO L225 Difference]: With dead ends: 12092 [2019-12-27 08:30:22,400 INFO L226 Difference]: Without dead ends: 12092 [2019-12-27 08:30:22,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-12-27 08:30:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12092 states. [2019-12-27 08:30:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12092 to 8256. [2019-12-27 08:30:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8256 states. [2019-12-27 08:30:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 27189 transitions. [2019-12-27 08:30:22,519 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 27189 transitions. Word has length 30 [2019-12-27 08:30:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:22,519 INFO L462 AbstractCegarLoop]: Abstraction has 8256 states and 27189 transitions. [2019-12-27 08:30:22,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:30:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 27189 transitions. [2019-12-27 08:30:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:22,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:22,527 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 08:30:22,527 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 08:30:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1793695977, now seen corresponding path program 3 times [2019-12-27 08:30:22,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:22,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670704833] [2019-12-27 08:30:22,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30: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 08:30:22,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670704833] [2019-12-27 08:30:22,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:22,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 08:30:22,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925172954] [2019-12-27 08:30:22,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:30:22,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:30:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:30:22,759 INFO L87 Difference]: Start difference. First operand 8256 states and 27189 transitions. Second operand 12 states. [2019-12-27 08:30:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:25,101 INFO L93 Difference]: Finished difference Result 17638 states and 58336 transitions. [2019-12-27 08:30:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:30:25,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-27 08:30:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:25,129 INFO L225 Difference]: With dead ends: 17638 [2019-12-27 08:30:25,129 INFO L226 Difference]: Without dead ends: 17638 [2019-12-27 08:30:25,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:30:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-27 08:30:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 7810. [2019-12-27 08:30:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7810 states. [2019-12-27 08:30:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 25817 transitions. [2019-12-27 08:30:25,289 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 25817 transitions. Word has length 30 [2019-12-27 08:30:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:25,289 INFO L462 AbstractCegarLoop]: Abstraction has 7810 states and 25817 transitions. [2019-12-27 08:30:25,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:30:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 25817 transitions. [2019-12-27 08:30:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:25,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:25,297 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 08:30:25,297 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 08:30:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 590262918, now seen corresponding path program 2 times [2019-12-27 08:30:25,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:25,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649849200] [2019-12-27 08:30:25,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:25,970 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-12-27 08:30:26,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 08:30:26,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649849200] [2019-12-27 08:30:26,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:26,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:30:26,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44706050] [2019-12-27 08:30:26,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:30:26,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:26,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:30:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:30:26,460 INFO L87 Difference]: Start difference. First operand 7810 states and 25817 transitions. Second operand 20 states. [2019-12-27 08:30:26,963 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-27 08:30:27,201 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-12-27 08:30:27,469 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-12-27 08:30:27,772 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-12-27 08:30:28,329 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2019-12-27 08:30:28,690 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-27 08:30:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:31,176 INFO L93 Difference]: Finished difference Result 12549 states and 41473 transitions. [2019-12-27 08:30:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 08:30:31,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 08:30:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:31,195 INFO L225 Difference]: With dead ends: 12549 [2019-12-27 08:30:31,195 INFO L226 Difference]: Without dead ends: 12549 [2019-12-27 08:30:31,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:30:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12549 states. [2019-12-27 08:30:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12549 to 8000. [2019-12-27 08:30:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2019-12-27 08:30:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 26387 transitions. [2019-12-27 08:30:31,318 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 26387 transitions. Word has length 30 [2019-12-27 08:30:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:31,319 INFO L462 AbstractCegarLoop]: Abstraction has 8000 states and 26387 transitions. [2019-12-27 08:30:31,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:30:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 26387 transitions. [2019-12-27 08:30:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:31,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:31,326 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 08:30:31,326 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 08:30:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1218334886, now seen corresponding path program 3 times [2019-12-27 08:30:31,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:31,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838870136] [2019-12-27 08:30:31,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:32,416 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 08:30:32,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838870136] [2019-12-27 08:30:32,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:32,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:30:32,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405807135] [2019-12-27 08:30:32,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:30:32,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:30:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:30:32,417 INFO L87 Difference]: Start difference. First operand 8000 states and 26387 transitions. Second operand 20 states. [2019-12-27 08:30:33,115 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-12-27 08:30:33,295 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-27 08:30:33,608 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-27 08:30:33,938 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-12-27 08:30:34,571 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 69 [2019-12-27 08:30:35,001 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-27 08:30:35,427 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-27 08:30:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:38,154 INFO L93 Difference]: Finished difference Result 12629 states and 41713 transitions. [2019-12-27 08:30:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 08:30:38,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 08:30:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:38,176 INFO L225 Difference]: With dead ends: 12629 [2019-12-27 08:30:38,176 INFO L226 Difference]: Without dead ends: 12629 [2019-12-27 08:30:38,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 08:30:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12629 states. [2019-12-27 08:30:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12629 to 7890. [2019-12-27 08:30:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7890 states. [2019-12-27 08:30:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7890 states to 7890 states and 26057 transitions. [2019-12-27 08:30:38,313 INFO L78 Accepts]: Start accepts. Automaton has 7890 states and 26057 transitions. Word has length 30 [2019-12-27 08:30:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:38,313 INFO L462 AbstractCegarLoop]: Abstraction has 7890 states and 26057 transitions. [2019-12-27 08:30:38,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:30:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7890 states and 26057 transitions. [2019-12-27 08:30:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:38,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:38,321 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 08:30:38,321 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 08:30:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1108143156, now seen corresponding path program 4 times [2019-12-27 08:30:38,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:38,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687025983] [2019-12-27 08:30:38,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:39,089 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 08:30:39,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687025983] [2019-12-27 08:30:39,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:39,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:30:39,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176563899] [2019-12-27 08:30:39,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:30:39,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:39,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:30:39,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:30:39,091 INFO L87 Difference]: Start difference. First operand 7890 states and 26057 transitions. Second operand 20 states. [2019-12-27 08:30:40,031 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-27 08:30:40,390 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-27 08:30:40,638 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-27 08:30:41,016 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 08:30:41,375 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-27 08:30:41,801 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-27 08:30:42,205 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2019-12-27 08:30:42,526 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-12-27 08:30:42,850 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2019-12-27 08:30:43,216 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-12-27 08:30:43,603 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-27 08:30:44,010 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-12-27 08:30:45,300 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-27 08:30:45,759 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-27 08:30:46,145 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-12-27 08:30:47,078 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-27 08:30:47,538 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-27 08:30:47,746 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-27 08:30:48,185 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-27 08:30:48,697 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-27 08:30:48,942 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-27 08:30:49,234 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-12-27 08:30:49,655 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-27 08:30:49,949 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-27 08:30:50,394 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-27 08:30:50,819 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-12-27 08:30:51,241 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-27 08:30:51,575 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-27 08:30:51,810 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2019-12-27 08:30:52,246 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-12-27 08:30:52,573 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-12-27 08:30:53,352 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-27 08:30:53,592 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-27 08:30:53,980 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-12-27 08:30:54,288 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-12-27 08:30:54,616 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-27 08:30:55,027 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-27 08:30:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:30:55,413 INFO L93 Difference]: Finished difference Result 18755 states and 62716 transitions. [2019-12-27 08:30:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 08:30:55,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 08:30:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:30:55,443 INFO L225 Difference]: With dead ends: 18755 [2019-12-27 08:30:55,443 INFO L226 Difference]: Without dead ends: 18755 [2019-12-27 08:30:55,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1209, Invalid=3621, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 08:30:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18755 states. [2019-12-27 08:30:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18755 to 9918. [2019-12-27 08:30:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9918 states. [2019-12-27 08:30:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9918 states to 9918 states and 33287 transitions. [2019-12-27 08:30:55,628 INFO L78 Accepts]: Start accepts. Automaton has 9918 states and 33287 transitions. Word has length 30 [2019-12-27 08:30:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:30:55,628 INFO L462 AbstractCegarLoop]: Abstraction has 9918 states and 33287 transitions. [2019-12-27 08:30:55,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:30:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9918 states and 33287 transitions. [2019-12-27 08:30:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:30:55,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:30:55,639 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 08:30:55,639 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 08:30:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:30:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash 124352686, now seen corresponding path program 5 times [2019-12-27 08:30:55,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:30:55,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228888004] [2019-12-27 08:30:55,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:30:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:30:56,386 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 08:30:56,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228888004] [2019-12-27 08:30:56,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:30:56,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:30:56,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465171686] [2019-12-27 08:30:56,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:30:56,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:30:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:30:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:30:56,388 INFO L87 Difference]: Start difference. First operand 9918 states and 33287 transitions. Second operand 20 states. [2019-12-27 08:30:57,281 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-27 08:30:57,581 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-27 08:30:57,807 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-27 08:30:58,168 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 08:30:58,480 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-27 08:30:58,855 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-12-27 08:30:59,067 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-27 08:30:59,396 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-12-27 08:30:59,656 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-27 08:30:59,873 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-12-27 08:31:00,086 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-27 08:31:00,702 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-12-27 08:31:02,627 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-27 08:31:02,952 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-27 08:31:03,164 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-27 08:31:03,445 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-27 08:31:03,853 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-27 08:31:04,102 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-27 08:31:04,458 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-27 08:31:04,861 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-27 08:31:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:05,994 INFO L93 Difference]: Finished difference Result 15447 states and 51817 transitions. [2019-12-27 08:31:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 08:31:05,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 08:31:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:06,020 INFO L225 Difference]: With dead ends: 15447 [2019-12-27 08:31:06,020 INFO L226 Difference]: Without dead ends: 15447 [2019-12-27 08:31:06,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=713, Invalid=2043, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 08:31:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-12-27 08:31:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 10782. [2019-12-27 08:31:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10782 states. [2019-12-27 08:31:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10782 states to 10782 states and 36202 transitions. [2019-12-27 08:31:06,186 INFO L78 Accepts]: Start accepts. Automaton has 10782 states and 36202 transitions. Word has length 30 [2019-12-27 08:31:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:06,186 INFO L462 AbstractCegarLoop]: Abstraction has 10782 states and 36202 transitions. [2019-12-27 08:31:06,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:31:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 10782 states and 36202 transitions. [2019-12-27 08:31:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:31:06,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:06,201 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 08:31:06,201 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 08:31:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1083255696, now seen corresponding path program 6 times [2019-12-27 08:31:06,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:06,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928720667] [2019-12-27 08:31:06,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:31:06,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928720667] [2019-12-27 08:31:06,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:06,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:31:06,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790577938] [2019-12-27 08:31:06,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:31:06,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:31:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:31:06,558 INFO L87 Difference]: Start difference. First operand 10782 states and 36202 transitions. Second operand 13 states. [2019-12-27 08:31:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:09,839 INFO L93 Difference]: Finished difference Result 18501 states and 61385 transitions. [2019-12-27 08:31:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 08:31:09,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-27 08:31:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:09,869 INFO L225 Difference]: With dead ends: 18501 [2019-12-27 08:31:09,869 INFO L226 Difference]: Without dead ends: 18501 [2019-12-27 08:31:09,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:31:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18501 states. [2019-12-27 08:31:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18501 to 9524. [2019-12-27 08:31:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9524 states. [2019-12-27 08:31:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 32100 transitions. [2019-12-27 08:31:10,044 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 32100 transitions. Word has length 30 [2019-12-27 08:31:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:10,044 INFO L462 AbstractCegarLoop]: Abstraction has 9524 states and 32100 transitions. [2019-12-27 08:31:10,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:31:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 32100 transitions. [2019-12-27 08:31:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:31:10,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:10,053 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 08:31:10,053 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 08:31:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 494321211, now seen corresponding path program 1 times [2019-12-27 08:31:10,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:10,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828902653] [2019-12-27 08:31:10,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:10,659 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-12-27 08:31:11,039 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 08:31:11,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828902653] [2019-12-27 08:31:11,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:11,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 08:31:11,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369633503] [2019-12-27 08:31:11,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:31:11,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:11,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:31:11,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:11,041 INFO L87 Difference]: Start difference. First operand 9524 states and 32100 transitions. Second operand 20 states. [2019-12-27 08:31:12,214 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-27 08:31:12,380 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-12-27 08:31:12,759 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-27 08:31:12,959 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-27 08:31:13,113 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-27 08:31:13,455 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-27 08:31:13,654 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-27 08:31:14,144 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-12-27 08:31:14,333 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-27 08:31:14,537 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-27 08:31:15,063 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-27 08:31:15,295 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-27 08:31:15,798 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-27 08:31:16,028 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-27 08:31:17,126 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-12-27 08:31:17,398 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-27 08:31:17,558 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-27 08:31:17,740 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-12-27 08:31:18,064 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 08:31:18,326 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-27 08:31:18,536 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-12-27 08:31:18,734 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-27 08:31:19,024 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 08:31:19,276 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-27 08:31:19,507 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-12-27 08:31:19,866 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-27 08:31:20,148 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2019-12-27 08:31:20,357 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-27 08:31:20,594 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-27 08:31:20,880 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-12-27 08:31:21,145 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-27 08:31:21,469 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-27 08:31:21,800 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-12-27 08:31:22,153 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-12-27 08:31:22,464 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-12-27 08:31:22,942 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-12-27 08:31:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:23,172 INFO L93 Difference]: Finished difference Result 10234 states and 34230 transitions. [2019-12-27 08:31:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 08:31:23,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-27 08:31:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:23,188 INFO L225 Difference]: With dead ends: 10234 [2019-12-27 08:31:23,188 INFO L226 Difference]: Without dead ends: 10234 [2019-12-27 08:31:23,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1312, Invalid=3518, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 08:31:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10234 states. [2019-12-27 08:31:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10234 to 10134. [2019-12-27 08:31:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10134 states. [2019-12-27 08:31:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10134 states to 10134 states and 33950 transitions. [2019-12-27 08:31:23,319 INFO L78 Accepts]: Start accepts. Automaton has 10134 states and 33950 transitions. Word has length 31 [2019-12-27 08:31:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:23,319 INFO L462 AbstractCegarLoop]: Abstraction has 10134 states and 33950 transitions. [2019-12-27 08:31:23,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:31:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 10134 states and 33950 transitions. [2019-12-27 08:31:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:31:23,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:23,329 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 08:31:23,329 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 08:31:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1182482853, now seen corresponding path program 2 times [2019-12-27 08:31:23,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:23,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086480155] [2019-12-27 08:31:23,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:24,135 WARN L192 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-12-27 08:31:24,706 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 08:31:24,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086480155] [2019-12-27 08:31:24,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:24,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 08:31:24,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24118848] [2019-12-27 08:31:24,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:31:24,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:31:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:31:24,707 INFO L87 Difference]: Start difference. First operand 10134 states and 33950 transitions. Second operand 18 states. [2019-12-27 08:31:25,867 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-27 08:31:26,216 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-12-27 08:31:26,404 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-27 08:31:26,548 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-27 08:31:26,872 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-27 08:31:27,008 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-27 08:31:27,179 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 08:31:27,623 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-27 08:31:27,807 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 08:31:28,024 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-27 08:31:28,487 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-12-27 08:31:28,709 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-12-27 08:31:29,151 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-12-27 08:31:29,374 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-12-27 08:31:30,400 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-12-27 08:31:30,664 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-27 08:31:30,806 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-27 08:31:30,977 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-27 08:31:31,269 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-12-27 08:31:31,452 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-27 08:31:31,643 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 08:31:31,830 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-27 08:31:32,092 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-27 08:31:32,333 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-27 08:31:32,547 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-27 08:31:32,881 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-12-27 08:31:33,080 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-12-27 08:31:33,318 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-27 08:31:33,525 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-27 08:31:33,752 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-27 08:31:34,027 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-27 08:31:34,296 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-27 08:31:34,595 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-12-27 08:31:34,912 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-12-27 08:31:35,245 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-12-27 08:31:35,547 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-12-27 08:31:36,013 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-12-27 08:31:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:36,243 INFO L93 Difference]: Finished difference Result 10394 states and 34730 transitions. [2019-12-27 08:31:36,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 08:31:36,243 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-12-27 08:31:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:36,259 INFO L225 Difference]: With dead ends: 10394 [2019-12-27 08:31:36,260 INFO L226 Difference]: Without dead ends: 10394 [2019-12-27 08:31:36,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1338, Invalid=3492, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 08:31:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10394 states. [2019-12-27 08:31:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10394 to 10164. [2019-12-27 08:31:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10164 states. [2019-12-27 08:31:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 34040 transitions. [2019-12-27 08:31:36,446 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 34040 transitions. Word has length 31 [2019-12-27 08:31:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:36,447 INFO L462 AbstractCegarLoop]: Abstraction has 10164 states and 34040 transitions. [2019-12-27 08:31:36,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:31:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 34040 transitions. [2019-12-27 08:31:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:31:36,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:36,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:36,456 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 08:31:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1713707043, now seen corresponding path program 3 times [2019-12-27 08:31:36,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:36,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240122652] [2019-12-27 08:31:36,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:37,346 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 08:31:37,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240122652] [2019-12-27 08:31:37,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:37,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:31:37,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720355523] [2019-12-27 08:31:37,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:31:37,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:37,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:31:37,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:31:37,349 INFO L87 Difference]: Start difference. First operand 10164 states and 34040 transitions. Second operand 19 states. [2019-12-27 08:31:38,895 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-27 08:31:39,299 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-27 08:31:39,670 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-12-27 08:31:39,852 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-27 08:31:40,431 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-27 08:31:40,800 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-27 08:31:40,996 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-27 08:31:41,205 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-27 08:31:41,614 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-27 08:31:42,209 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-12-27 08:31:42,415 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-27 08:31:42,693 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-12-27 08:31:42,930 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-27 08:31:43,232 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-27 08:31:43,601 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-27 08:31:43,975 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-27 08:31:44,273 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-12-27 08:31:44,522 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-12-27 08:31:44,738 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-27 08:31:44,962 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-12-27 08:31:45,240 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-27 08:31:45,491 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-27 08:31:45,767 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-12-27 08:31:46,017 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-27 08:31:46,366 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 87 [2019-12-27 08:31:46,639 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-27 08:31:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:46,838 INFO L93 Difference]: Finished difference Result 11104 states and 36850 transitions. [2019-12-27 08:31:46,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 08:31:46,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 08:31:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:46,855 INFO L225 Difference]: With dead ends: 11104 [2019-12-27 08:31:46,855 INFO L226 Difference]: Without dead ends: 11104 [2019-12-27 08:31:46,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=970, Invalid=2452, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 08:31:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2019-12-27 08:31:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10434. [2019-12-27 08:31:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-12-27 08:31:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 34870 transitions. [2019-12-27 08:31:46,990 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 34870 transitions. Word has length 31 [2019-12-27 08:31:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:46,990 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 34870 transitions. [2019-12-27 08:31:46,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:31:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 34870 transitions. [2019-12-27 08:31:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:31:47,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:47,000 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 08:31:47,000 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 08:31:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:47,000 INFO L82 PathProgramCache]: Analyzing trace with hash -90243807, now seen corresponding path program 4 times [2019-12-27 08:31:47,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:47,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367446742] [2019-12-27 08:31:47,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:48,049 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 08:31:48,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367446742] [2019-12-27 08:31:48,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:48,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:31:48,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058899947] [2019-12-27 08:31:48,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:31:48,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:48,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:31:48,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:31:48,050 INFO L87 Difference]: Start difference. First operand 10434 states and 34870 transitions. Second operand 19 states. [2019-12-27 08:31:49,822 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-27 08:31:50,382 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-12-27 08:31:50,575 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-27 08:31:51,086 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-27 08:31:51,315 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-27 08:31:51,524 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 08:31:52,008 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 08:31:52,384 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-27 08:31:52,675 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-27 08:31:53,027 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-27 08:31:53,242 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-27 08:31:53,620 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 08:31:54,173 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-12-27 08:31:54,512 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-12-27 08:31:55,107 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-27 08:31:55,346 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-12-27 08:31:56,728 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-12-27 08:31:57,419 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-27 08:31:57,792 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-12-27 08:31:57,972 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-27 08:31:58,178 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-12-27 08:31:58,401 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-27 08:31:58,706 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-12-27 08:31:58,911 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-12-27 08:31:59,164 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-27 08:31:59,397 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-27 08:31:59,747 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-12-27 08:32:00,085 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-27 08:32:00,346 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-27 08:32:00,767 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-27 08:32:00,977 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-27 08:32:01,264 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-27 08:32:01,509 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-12-27 08:32:01,812 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2019-12-27 08:32:02,135 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-27 08:32:02,464 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-27 08:32:02,833 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-12-27 08:32:03,214 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2019-12-27 08:32:03,618 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-12-27 08:32:03,973 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 76 [2019-12-27 08:32:04,606 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 80 [2019-12-27 08:32:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:04,968 INFO L93 Difference]: Finished difference Result 12204 states and 40170 transitions. [2019-12-27 08:32:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 08:32:04,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 08:32:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:04,985 INFO L225 Difference]: With dead ends: 12204 [2019-12-27 08:32:04,986 INFO L226 Difference]: Without dead ends: 12204 [2019-12-27 08:32:04,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1810, Invalid=4996, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 08:32:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12204 states. [2019-12-27 08:32:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12204 to 10624. [2019-12-27 08:32:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-12-27 08:32:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 35460 transitions. [2019-12-27 08:32:05,130 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 35460 transitions. Word has length 31 [2019-12-27 08:32:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:05,130 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 35460 transitions. [2019-12-27 08:32:05,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:32:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 35460 transitions. [2019-12-27 08:32:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:32:05,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:05,142 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 08:32:05,142 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 08:32:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1227210307, now seen corresponding path program 5 times [2019-12-27 08:32:05,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:05,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639927235] [2019-12-27 08:32:05,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:32:06,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639927235] [2019-12-27 08:32:06,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:06,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:32:06,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779496570] [2019-12-27 08:32:06,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:32:06,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:32:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:32:06,063 INFO L87 Difference]: Start difference. First operand 10624 states and 35460 transitions. Second operand 19 states. [2019-12-27 08:32:07,650 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-27 08:32:08,335 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-27 08:32:08,754 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-12-27 08:32:08,922 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-27 08:32:09,564 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-27 08:32:10,008 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-27 08:32:10,208 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-27 08:32:10,415 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-12-27 08:32:10,862 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-27 08:32:11,503 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-12-27 08:32:11,746 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-27 08:32:12,114 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-12-27 08:32:12,369 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-27 08:32:12,705 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-12-27 08:32:12,995 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-12-27 08:32:13,397 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-12-27 08:32:13,706 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-12-27 08:32:13,955 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-27 08:32:14,187 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-27 08:32:14,404 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-12-27 08:32:14,699 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-27 08:32:14,946 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-27 08:32:15,221 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-12-27 08:32:15,490 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-27 08:32:15,863 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 87 [2019-12-27 08:32:16,164 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-27 08:32:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:16,444 INFO L93 Difference]: Finished difference Result 11874 states and 39220 transitions. [2019-12-27 08:32:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 08:32:16,444 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-27 08:32:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:16,461 INFO L225 Difference]: With dead ends: 11874 [2019-12-27 08:32:16,461 INFO L226 Difference]: Without dead ends: 11874 [2019-12-27 08:32:16,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=993, Invalid=2547, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 08:32:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11874 states. [2019-12-27 08:32:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11874 to 10626. [2019-12-27 08:32:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-27 08:32:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 35466 transitions. [2019-12-27 08:32:16,602 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 35466 transitions. Word has length 31 [2019-12-27 08:32:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:16,602 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 35466 transitions. [2019-12-27 08:32:16,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:32:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 35466 transitions. [2019-12-27 08:32:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:32:16,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:16,612 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 08:32:16,612 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 08:32:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:16,613 INFO L82 PathProgramCache]: Analyzing trace with hash -549236217, now seen corresponding path program 6 times [2019-12-27 08:32:16,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:16,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209799314] [2019-12-27 08:32:16,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:17,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 08:32:17,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209799314] [2019-12-27 08:32:17,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:17,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 08:32:17,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466012003] [2019-12-27 08:32:17,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:32:17,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:32:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:32:17,446 INFO L87 Difference]: Start difference. First operand 10626 states and 35466 transitions. Second operand 19 states. [2019-12-27 08:32:19,236 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-12-27 08:32:19,570 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-27 08:32:19,952 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-27 08:32:20,509 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-27 08:32:20,796 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-12-27 08:32:21,008 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-12-27 08:32:21,184 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-27 08:32:21,702 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-27 08:32:22,057 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 08:32:22,545 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 08:32:22,867 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-27 08:32:23,076 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-27 08:32:23,369 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-12-27 08:32:23,966 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-12-27 08:32:24,247 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-12-27 08:32:24,838 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-12-27 08:32:25,064 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-27 08:32:26,422 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 Received shutdown request... [2019-12-27 08:32:26,812 WARN L209 SmtUtils]: Removed 13 from assertion stack [2019-12-27 08:32:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 08:32:26,813 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 08:32:26,816 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 08:32:26,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:32:26 BasicIcfg [2019-12-27 08:32:26,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:32:26,817 INFO L168 Benchmark]: Toolchain (without parser) took 245261.08 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.0 MB in the beginning and 164.8 MB in the end (delta: -63.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,818 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1077.30 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 122.9 MB in the end (delta: -22.3 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.97 ms. Allocated memory is still 201.3 MB. Free memory was 122.2 MB in the beginning and 119.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,818 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 ms. Allocated memory is still 201.3 MB. Free memory was 119.4 MB in the beginning and 117.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,819 INFO L168 Benchmark]: RCFGBuilder took 707.00 ms. Allocated memory was 201.3 MB in the beginning and 234.9 MB in the end (delta: 33.6 MB). Free memory was 117.4 MB in the beginning and 195.2 MB in the end (delta: -77.8 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,819 INFO L168 Benchmark]: TraceAbstraction took 243359.65 ms. Allocated memory was 234.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 195.2 MB in the beginning and 164.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 08:32:26,821 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.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1077.30 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 122.9 MB in the end (delta: -22.3 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.97 ms. Allocated memory is still 201.3 MB. Free memory was 122.2 MB in the beginning and 119.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.16 ms. Allocated memory is still 201.3 MB. Free memory was 119.4 MB in the beginning and 117.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 707.00 ms. Allocated memory was 201.3 MB in the beginning and 234.9 MB in the end (delta: 33.6 MB). Free memory was 117.4 MB in the beginning and 195.2 MB in the end (delta: -77.8 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243359.65 ms. Allocated memory was 234.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 195.2 MB in the beginning and 164.8 MB in the end (delta: 30.4 MB). 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: 3.7s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 6 ChoiceCompositions, 7548 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 20948 CheckedPairsTotal, 149 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 (10626states) and FLOYD_HOARE automaton (currently 48 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 27ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (10626states) and FLOYD_HOARE automaton (currently 48 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 27ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (10626states) and FLOYD_HOARE automaton (currently 48 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 27ms.. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (10626states) and FLOYD_HOARE automaton (currently 48 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 27ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 243.1s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 203.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3156 SDtfs, 14117 SDslu, 14840 SDs, 0 SdLazy, 87169 SolverSat, 1681 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1432 GetRequests, 32 SyntacticMatches, 30 SemanticMatches, 1369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8732 ImplicationChecksByTransitivity, 116.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10782occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 42 MinimizatonAttempts, 97554 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 1170 NumberOfCodeBlocks, 1170 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 844571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown