/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:25:46,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:25:46,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:25:46,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:25:46,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:25:46,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:25:46,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:25:46,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:25:46,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:25:46,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:25:46,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:25:46,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:25:46,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:25:46,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:25:46,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:25:46,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:25:46,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:25:46,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:25:46,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:25:46,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:25:46,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:25:46,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:25:46,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:25:46,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:25:46,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:25:46,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:25:46,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:25:46,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:25:46,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:25:46,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:25:46,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:25:46,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:25:46,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:25:46,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:25:46,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:25:46,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:25:46,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:25:46,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:25:46,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:25:46,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:25:46,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:25:46,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:25:46,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:25:46,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:25:46,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:25:46,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:25:46,270 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:25:46,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:25:46,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:25:46,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:25:46,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:25:46,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:25:46,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:25:46,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:25:46,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:25:46,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:25:46,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:25:46,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:25:46,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:25:46,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:25:46,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:25:46,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:25:46,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:25:46,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:25:46,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:25:46,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:25:46,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:25:46,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:25:46,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:25:46,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:25:46,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:25:46,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:25:46,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:25:46,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:25:46,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:25:46,593 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:25:46,594 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-18 19:25:46,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106af256e/5406a60fa40d4278a5531a6b217dee1d/FLAG261836d5e [2019-12-18 19:25:47,220 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:25:47,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-18 19:25:47,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106af256e/5406a60fa40d4278a5531a6b217dee1d/FLAG261836d5e [2019-12-18 19:25:47,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106af256e/5406a60fa40d4278a5531a6b217dee1d [2019-12-18 19:25:47,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:25:47,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:25:47,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:25:47,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:25:47,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:25:47,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:25:47" (1/1) ... [2019-12-18 19:25:47,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee0fa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:47, skipping insertion in model container [2019-12-18 19:25:47,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:25:47" (1/1) ... [2019-12-18 19:25:47,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:25:47,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:25:47,786 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 19:25:48,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:25:48,215 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:25:48,239 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 19:25:48,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:25:48,505 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:25:48,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48 WrapperNode [2019-12-18 19:25:48,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:25:48,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:25:48,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:25:48,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:25:48,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:25:48,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:25:48,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:25:48,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:25:48,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... [2019-12-18 19:25:48,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:25:48,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:25:48,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:25:48,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:25:48,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:25:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-18 19:25:48,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-18 19:25:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-18 19:25:48,732 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-18 19:25:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:25:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:25:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:25:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:25:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 19:25:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:25:48,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:25:48,735 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:25:49,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:25:49,457 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-18 19:25:49,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:25:49 BoogieIcfgContainer [2019-12-18 19:25:49,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:25:49,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:25:49,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:25:49,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:25:49,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:25:47" (1/3) ... [2019-12-18 19:25:49,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f1d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:25:49, skipping insertion in model container [2019-12-18 19:25:49,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:25:48" (2/3) ... [2019-12-18 19:25:49,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f1d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:25:49, skipping insertion in model container [2019-12-18 19:25:49,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:25:49" (3/3) ... [2019-12-18 19:25:49,466 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-18 19:25:49,475 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:25:49,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:25:49,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-18 19:25:49,483 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:25:49,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,529 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,529 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,530 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,530 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,530 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,530 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,531 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,531 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,531 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,533 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,534 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,534 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,534 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,535 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,535 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,535 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,536 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,537 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,537 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,537 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,537 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,537 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,538 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,538 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,538 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,539 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,539 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,539 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,539 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,540 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,540 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,540 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,540 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,541 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,541 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,542 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,542 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,542 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,542 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,542 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,543 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,544 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,544 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,547 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,547 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,547 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,547 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,547 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,547 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,548 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,548 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,548 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,549 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,550 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,552 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,552 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,552 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,552 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,553 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,554 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,554 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,555 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,555 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,555 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,556 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,556 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,557 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,557 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,557 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,558 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,558 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,558 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,559 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,559 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,561 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,561 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,561 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,561 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,561 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,562 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,562 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,562 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,562 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,562 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,562 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,563 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,563 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,563 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,563 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,563 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,564 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,564 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,564 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,568 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,568 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,568 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,569 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,569 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,569 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,569 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,569 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,570 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,570 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,570 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,570 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,570 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,571 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,571 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,571 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,571 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,571 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,579 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,583 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,583 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,584 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,585 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,585 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,585 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,585 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,585 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,585 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:25:49,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-18 19:25:49,626 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:25:49,626 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:25:49,626 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:25:49,626 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:25:49,627 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:25:49,627 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:25:49,627 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:25:49,627 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:25:49,644 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-18 19:25:49,646 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-18 19:25:49,731 INFO L126 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-18 19:25:49,732 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:25:49,750 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 19/187 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-18 19:25:49,772 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-18 19:25:49,819 INFO L126 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-18 19:25:49,819 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:25:49,828 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 19/187 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-18 19:25:49,849 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-18 19:25:49,850 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:25:50,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:50,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:50,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:50,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:51,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:52,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:25:53,977 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-18 19:25:54,548 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20924 [2019-12-18 19:25:54,549 INFO L214 etLargeBlockEncoding]: Total number of compositions: 153 [2019-12-18 19:25:54,553 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-18 19:25:54,662 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-18 19:25:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-18 19:25:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:25:54,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:54,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:54,685 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-18 19:25:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash -437483837, now seen corresponding path program 1 times [2019-12-18 19:25:54,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:54,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594560423] [2019-12-18 19:25:54,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:55,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594560423] [2019-12-18 19:25:55,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:55,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:25:55,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483803350] [2019-12-18 19:25:55,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:25:55,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:25:55,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:25:55,212 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-18 19:25:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:55,570 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-18 19:25:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:25:55,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 19:25:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:55,611 INFO L225 Difference]: With dead ends: 2169 [2019-12-18 19:25:55,611 INFO L226 Difference]: Without dead ends: 2053 [2019-12-18 19:25:55,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:25:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-18 19:25:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-18 19:25:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-18 19:25:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-18 19:25:55,771 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-18 19:25:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:55,772 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-18 19:25:55,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:25:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-18 19:25:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:25:55,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:55,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:55,776 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-18 19:25:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -357357885, now seen corresponding path program 1 times [2019-12-18 19:25:55,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:55,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240623365] [2019-12-18 19:25:55,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:55,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240623365] [2019-12-18 19:25:55,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:55,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:25:55,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443416351] [2019-12-18 19:25:55,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:25:55,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:25:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:25:55,986 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-18 19:25:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:56,594 INFO L93 Difference]: Finished difference Result 2588 states and 8385 transitions. [2019-12-18 19:25:56,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:25:56,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 19:25:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:56,618 INFO L225 Difference]: With dead ends: 2588 [2019-12-18 19:25:56,618 INFO L226 Difference]: Without dead ends: 2544 [2019-12-18 19:25:56,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:25:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-12-18 19:25:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2019-12-18 19:25:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-18 19:25:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-18 19:25:56,710 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-18 19:25:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:56,710 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-18 19:25:56,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:25:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-18 19:25:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:25:56,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:56,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:56,716 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-18 19:25:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash -220223314, now seen corresponding path program 1 times [2019-12-18 19:25:56,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:56,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858129825] [2019-12-18 19:25:56,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:25:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:25:57,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858129825] [2019-12-18 19:25:57,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:25:57,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:25:57,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775183549] [2019-12-18 19:25:57,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:25:57,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:25:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:25:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:25:57,340 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 14 states. [2019-12-18 19:25:59,042 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 19:25:59,282 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-18 19:25:59,539 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 19:25:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:25:59,793 INFO L93 Difference]: Finished difference Result 3164 states and 10236 transitions. [2019-12-18 19:25:59,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:25:59,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:25:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:25:59,816 INFO L225 Difference]: With dead ends: 3164 [2019-12-18 19:25:59,817 INFO L226 Difference]: Without dead ends: 3164 [2019-12-18 19:25:59,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:25:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-12-18 19:25:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3104. [2019-12-18 19:25:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-12-18 19:25:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 10106 transitions. [2019-12-18 19:25:59,914 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 10106 transitions. Word has length 25 [2019-12-18 19:25:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:25:59,915 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 10106 transitions. [2019-12-18 19:25:59,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:25:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 10106 transitions. [2019-12-18 19:25:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:25:59,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:25:59,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:25:59,922 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-18 19:25:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:25:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1041383458, now seen corresponding path program 1 times [2019-12-18 19:25:59,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:25:59,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960680114] [2019-12-18 19:25:59,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:25:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:00,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960680114] [2019-12-18 19:26:00,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:00,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:26:00,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365741046] [2019-12-18 19:26:00,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:26:00,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:26:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:26:00,405 INFO L87 Difference]: Start difference. First operand 3104 states and 10106 transitions. Second operand 12 states. [2019-12-18 19:26:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:02,211 INFO L93 Difference]: Finished difference Result 3654 states and 11776 transitions. [2019-12-18 19:26:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:26:02,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 19:26:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:02,236 INFO L225 Difference]: With dead ends: 3654 [2019-12-18 19:26:02,236 INFO L226 Difference]: Without dead ends: 3654 [2019-12-18 19:26:02,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:26:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-18 19:26:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-18 19:26:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-18 19:26:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-18 19:26:02,398 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-18 19:26:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:02,398 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-18 19:26:02,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:26:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-18 19:26:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:02,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:02,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:02,406 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-18 19:26:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash 907099404, now seen corresponding path program 2 times [2019-12-18 19:26:02,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:02,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122963920] [2019-12-18 19:26:02,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:02,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122963920] [2019-12-18 19:26:02,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:02,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:02,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526827891] [2019-12-18 19:26:02,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:02,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:02,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:02,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:02,910 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 13 states. [2019-12-18 19:26:05,228 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-18 19:26:05,443 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-18 19:26:05,716 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-18 19:26:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:06,047 INFO L93 Difference]: Finished difference Result 5414 states and 17426 transitions. [2019-12-18 19:26:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:26:06,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:06,080 INFO L225 Difference]: With dead ends: 5414 [2019-12-18 19:26:06,080 INFO L226 Difference]: Without dead ends: 5414 [2019-12-18 19:26:06,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-12-18 19:26:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-12-18 19:26:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 3844. [2019-12-18 19:26:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-18 19:26:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 12546 transitions. [2019-12-18 19:26:06,203 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 12546 transitions. Word has length 25 [2019-12-18 19:26:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:06,203 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 12546 transitions. [2019-12-18 19:26:06,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 12546 transitions. [2019-12-18 19:26:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:06,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:06,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:06,212 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-18 19:26:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 356628326, now seen corresponding path program 3 times [2019-12-18 19:26:06,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:06,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444143844] [2019-12-18 19:26:06,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:06,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444143844] [2019-12-18 19:26:06,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:06,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:06,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484764177] [2019-12-18 19:26:06,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:26:06,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:26:06,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:26:06,880 INFO L87 Difference]: Start difference. First operand 3844 states and 12546 transitions. Second operand 14 states. [2019-12-18 19:26:10,244 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-12-18 19:26:10,386 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-18 19:26:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:10,780 INFO L93 Difference]: Finished difference Result 4818 states and 15403 transitions. [2019-12-18 19:26:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 19:26:10,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 19:26:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:10,795 INFO L225 Difference]: With dead ends: 4818 [2019-12-18 19:26:10,796 INFO L226 Difference]: Without dead ends: 4818 [2019-12-18 19:26:10,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:26:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2019-12-18 19:26:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3188. [2019-12-18 19:26:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-18 19:26:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-18 19:26:10,893 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-18 19:26:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:10,893 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-18 19:26:10,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:26:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-18 19:26:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:10,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:10,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:10,900 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-18 19:26:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1491389276, now seen corresponding path program 2 times [2019-12-18 19:26:10,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:10,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49904945] [2019-12-18 19:26:10,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:11,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49904945] [2019-12-18 19:26:11,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:11,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:26:11,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908653708] [2019-12-18 19:26:11,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:26:11,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:11,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:26:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:26:11,416 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 13 states. [2019-12-18 19:26:13,799 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-18 19:26:14,148 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-18 19:26:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:14,467 INFO L93 Difference]: Finished difference Result 4168 states and 13116 transitions. [2019-12-18 19:26:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 19:26:14,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 19:26:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:14,480 INFO L225 Difference]: With dead ends: 4168 [2019-12-18 19:26:14,481 INFO L226 Difference]: Without dead ends: 4168 [2019-12-18 19:26:14,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2019-12-18 19:26:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-12-18 19:26:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 3188. [2019-12-18 19:26:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-18 19:26:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10166 transitions. [2019-12-18 19:26:14,570 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10166 transitions. Word has length 25 [2019-12-18 19:26:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:14,571 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10166 transitions. [2019-12-18 19:26:14,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:26:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10166 transitions. [2019-12-18 19:26:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:26:14,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:14,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:14,577 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-18 19:26:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1997301412, now seen corresponding path program 3 times [2019-12-18 19:26:14,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:14,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436114084] [2019-12-18 19:26:14,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:14,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436114084] [2019-12-18 19:26:14,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:14,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:26:14,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789999511] [2019-12-18 19:26:14,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:26:14,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:26:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:26:14,968 INFO L87 Difference]: Start difference. First operand 3188 states and 10166 transitions. Second operand 12 states. [2019-12-18 19:26:16,692 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-18 19:26:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:17,489 INFO L93 Difference]: Finished difference Result 3972 states and 12550 transitions. [2019-12-18 19:26:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:17,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 19:26:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:17,502 INFO L225 Difference]: With dead ends: 3972 [2019-12-18 19:26:17,502 INFO L226 Difference]: Without dead ends: 3972 [2019-12-18 19:26:17,503 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-18 19:26:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2019-12-18 19:26:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2852. [2019-12-18 19:26:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-18 19:26:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-18 19:26:17,584 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-18 19:26:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:17,584 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-18 19:26:17,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:26:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-18 19:26:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:17,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:17,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:17,590 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-18 19:26:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512480, now seen corresponding path program 1 times [2019-12-18 19:26:17,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:17,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179350900] [2019-12-18 19:26:17,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:18,101 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32 [2019-12-18 19:26:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:18,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179350900] [2019-12-18 19:26:18,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:18,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:18,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734793963] [2019-12-18 19:26:18,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:18,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:18,365 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 16 states. [2019-12-18 19:26:19,467 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-12-18 19:26:19,724 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 19:26:20,030 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 19:26:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:21,489 INFO L93 Difference]: Finished difference Result 5017 states and 16132 transitions. [2019-12-18 19:26:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:21,489 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:21,501 INFO L225 Difference]: With dead ends: 5017 [2019-12-18 19:26:21,501 INFO L226 Difference]: Without dead ends: 5017 [2019-12-18 19:26:21,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-12-18 19:26:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2019-12-18 19:26:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-18 19:26:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13063 transitions. [2019-12-18 19:26:21,640 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13063 transitions. Word has length 27 [2019-12-18 19:26:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:21,640 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13063 transitions. [2019-12-18 19:26:21,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13063 transitions. [2019-12-18 19:26:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:21,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:21,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-18 19:26:21,651 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-18 19:26:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:21,652 INFO L82 PathProgramCache]: Analyzing trace with hash 363501539, now seen corresponding path program 1 times [2019-12-18 19:26:21,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:21,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739782369] [2019-12-18 19:26:21,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:22,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739782369] [2019-12-18 19:26:22,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:22,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:22,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096953451] [2019-12-18 19:26:22,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:26:22,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:22,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:26:22,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:26:22,294 INFO L87 Difference]: Start difference. First operand 4102 states and 13063 transitions. Second operand 15 states. [2019-12-18 19:26:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:24,793 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-18 19:26:24,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:26:24,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:26:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:24,803 INFO L225 Difference]: With dead ends: 6137 [2019-12-18 19:26:24,803 INFO L226 Difference]: Without dead ends: 6137 [2019-12-18 19:26:24,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:26:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-18 19:26:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-18 19:26:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-18 19:26:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-18 19:26:24,918 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-18 19:26:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:24,918 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-18 19:26:24,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:26:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-18 19:26:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:24,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:24,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:24,928 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-18 19:26:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139074, now seen corresponding path program 2 times [2019-12-18 19:26:24,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:24,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466404523] [2019-12-18 19:26:24,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:25,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466404523] [2019-12-18 19:26:25,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:25,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:25,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019270009] [2019-12-18 19:26:25,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:25,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:25,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:25,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:25,598 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 16 states. [2019-12-18 19:26:25,882 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-12-18 19:26:27,056 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-18 19:26:27,371 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 19:26:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:28,929 INFO L93 Difference]: Finished difference Result 7329 states and 23441 transitions. [2019-12-18 19:26:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:28,929 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:28,941 INFO L225 Difference]: With dead ends: 7329 [2019-12-18 19:26:28,941 INFO L226 Difference]: Without dead ends: 7329 [2019-12-18 19:26:28,941 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-18 19:26:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-18 19:26:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 5934. [2019-12-18 19:26:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2019-12-18 19:26:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 18887 transitions. [2019-12-18 19:26:29,074 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 18887 transitions. Word has length 27 [2019-12-18 19:26:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:29,075 INFO L462 AbstractCegarLoop]: Abstraction has 5934 states and 18887 transitions. [2019-12-18 19:26:29,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 18887 transitions. [2019-12-18 19:26:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:29,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:29,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:29,086 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-18 19:26:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139073, now seen corresponding path program 1 times [2019-12-18 19:26:29,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:29,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805610409] [2019-12-18 19:26:29,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:29,598 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-12-18 19:26:29,767 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-12-18 19:26:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:30,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805610409] [2019-12-18 19:26:30,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:30,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:30,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240792522] [2019-12-18 19:26:30,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:30,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:30,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:30,024 INFO L87 Difference]: Start difference. First operand 5934 states and 18887 transitions. Second operand 16 states. [2019-12-18 19:26:31,050 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 19:26:31,330 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 19:26:31,615 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 19:26:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:33,107 INFO L93 Difference]: Finished difference Result 7329 states and 23321 transitions. [2019-12-18 19:26:33,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:33,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:33,118 INFO L225 Difference]: With dead ends: 7329 [2019-12-18 19:26:33,118 INFO L226 Difference]: Without dead ends: 7329 [2019-12-18 19:26:33,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-18 19:26:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 4804. [2019-12-18 19:26:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-18 19:26:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-18 19:26:33,312 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-18 19:26:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:33,314 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-18 19:26:33,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-18 19:26:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:33,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:33,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:33,325 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-18 19:26:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227084, now seen corresponding path program 3 times [2019-12-18 19:26:33,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:33,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804677564] [2019-12-18 19:26:33,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:33,830 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-12-18 19:26:34,006 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-18 19:26:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:34,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804677564] [2019-12-18 19:26:34,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:34,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:34,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247311339] [2019-12-18 19:26:34,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:34,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:34,225 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-18 19:26:35,474 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-18 19:26:35,752 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-12-18 19:26:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:37,450 INFO L93 Difference]: Finished difference Result 6739 states and 21561 transitions. [2019-12-18 19:26:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:37,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:37,459 INFO L225 Difference]: With dead ends: 6739 [2019-12-18 19:26:37,459 INFO L226 Difference]: Without dead ends: 6739 [2019-12-18 19:26:37,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2019-12-18 19:26:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 4804. [2019-12-18 19:26:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-18 19:26:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-18 19:26:37,569 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-18 19:26:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:37,570 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-18 19:26:37,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-18 19:26:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:37,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:37,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:37,580 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-18 19:26:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash 796249174, now seen corresponding path program 4 times [2019-12-18 19:26:37,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:37,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786649837] [2019-12-18 19:26:37,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:38,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786649837] [2019-12-18 19:26:38,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:38,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:38,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580669556] [2019-12-18 19:26:38,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:26:38,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:26:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:26:38,179 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 15 states. [2019-12-18 19:26:39,475 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 19:26:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:41,191 INFO L93 Difference]: Finished difference Result 6619 states and 21201 transitions. [2019-12-18 19:26:41,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:41,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:26:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:41,201 INFO L225 Difference]: With dead ends: 6619 [2019-12-18 19:26:41,201 INFO L226 Difference]: Without dead ends: 6619 [2019-12-18 19:26:41,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-18 19:26:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4804. [2019-12-18 19:26:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-12-18 19:26:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2019-12-18 19:26:41,326 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2019-12-18 19:26:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:41,326 INFO L462 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2019-12-18 19:26:41,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:26:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2019-12-18 19:26:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:41,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:41,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:41,338 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-18 19:26:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash 471322490, now seen corresponding path program 5 times [2019-12-18 19:26:41,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:41,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778757796] [2019-12-18 19:26:41,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:42,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778757796] [2019-12-18 19:26:42,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:42,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:42,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182692891] [2019-12-18 19:26:42,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:42,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:42,079 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2019-12-18 19:26:43,397 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 19:26:43,806 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-18 19:26:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:45,861 INFO L93 Difference]: Finished difference Result 8562 states and 27685 transitions. [2019-12-18 19:26:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:26:45,861 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:45,875 INFO L225 Difference]: With dead ends: 8562 [2019-12-18 19:26:45,875 INFO L226 Difference]: Without dead ends: 8562 [2019-12-18 19:26:45,876 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-18 19:26:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-12-18 19:26:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 4849. [2019-12-18 19:26:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-18 19:26:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-18 19:26:46,002 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-18 19:26:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:46,003 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-18 19:26:46,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-18 19:26:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:46,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:46,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:46,013 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-18 19:26:46,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash -869839874, now seen corresponding path program 6 times [2019-12-18 19:26:46,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:46,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676668126] [2019-12-18 19:26:46,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:46,622 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-18 19:26:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:46,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676668126] [2019-12-18 19:26:46,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:46,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:46,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850741474] [2019-12-18 19:26:46,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:46,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:46,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:46,850 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-18 19:26:48,254 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-12-18 19:26:48,538 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-12-18 19:26:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:50,136 INFO L93 Difference]: Finished difference Result 7194 states and 22926 transitions. [2019-12-18 19:26:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:26:50,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:50,147 INFO L225 Difference]: With dead ends: 7194 [2019-12-18 19:26:50,147 INFO L226 Difference]: Without dead ends: 7194 [2019-12-18 19:26:50,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-18 19:26:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-12-18 19:26:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 4849. [2019-12-18 19:26:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-18 19:26:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2019-12-18 19:26:50,253 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2019-12-18 19:26:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:50,253 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2019-12-18 19:26:50,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2019-12-18 19:26:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:50,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:50,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:50,262 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-18 19:26:50,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360997, now seen corresponding path program 2 times [2019-12-18 19:26:50,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:50,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085957819] [2019-12-18 19:26:50,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:50,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085957819] [2019-12-18 19:26:50,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:50,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:50,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624652016] [2019-12-18 19:26:50,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:50,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:50,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:50,992 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2019-12-18 19:26:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:53,781 INFO L93 Difference]: Finished difference Result 7028 states and 22548 transitions. [2019-12-18 19:26:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:53,782 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:53,792 INFO L225 Difference]: With dead ends: 7028 [2019-12-18 19:26:53,792 INFO L226 Difference]: Without dead ends: 7028 [2019-12-18 19:26:53,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-18 19:26:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 6003. [2019-12-18 19:26:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6003 states. [2019-12-18 19:26:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 19104 transitions. [2019-12-18 19:26:53,923 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 19104 transitions. Word has length 27 [2019-12-18 19:26:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:53,923 INFO L462 AbstractCegarLoop]: Abstraction has 6003 states and 19104 transitions. [2019-12-18 19:26:53,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 19104 transitions. [2019-12-18 19:26:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:53,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:53,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:26:53,934 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-18 19:26:53,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:53,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360998, now seen corresponding path program 1 times [2019-12-18 19:26:53,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:53,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930702636] [2019-12-18 19:26:53,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:54,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930702636] [2019-12-18 19:26:54,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:54,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:26:54,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400048641] [2019-12-18 19:26:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:26:54,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:26:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:26:54,663 INFO L87 Difference]: Start difference. First operand 6003 states and 19104 transitions. Second operand 16 states. [2019-12-18 19:26:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:26:57,483 INFO L93 Difference]: Finished difference Result 7028 states and 22428 transitions. [2019-12-18 19:26:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:26:57,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:26:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:26:57,494 INFO L225 Difference]: With dead ends: 7028 [2019-12-18 19:26:57,494 INFO L226 Difference]: Without dead ends: 7028 [2019-12-18 19:26:57,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:26:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2019-12-18 19:26:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 4733. [2019-12-18 19:26:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-18 19:26:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-18 19:26:57,566 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-18 19:26:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:26:57,566 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-18 19:26:57,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:26:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-18 19:26:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:26:57,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:26:57,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-18 19:26:57,573 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-18 19:26:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:26:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash -122346011, now seen corresponding path program 3 times [2019-12-18 19:26:57,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:26:57,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521819841] [2019-12-18 19:26:57,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:26:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:26:58,113 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-12-18 19:26:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:26:58,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521819841] [2019-12-18 19:26:58,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:26:58,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:26:58,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389088500] [2019-12-18 19:26:58,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:26:58,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:26:58,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:26:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:26:58,441 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-18 19:26:59,597 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-18 19:27:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:01,136 INFO L93 Difference]: Finished difference Result 6548 states and 20998 transitions. [2019-12-18 19:27:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:27:01,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:01,146 INFO L225 Difference]: With dead ends: 6548 [2019-12-18 19:27:01,146 INFO L226 Difference]: Without dead ends: 6548 [2019-12-18 19:27:01,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 19:27:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-12-18 19:27:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 4733. [2019-12-18 19:27:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2019-12-18 19:27:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2019-12-18 19:27:01,213 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2019-12-18 19:27:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:01,214 INFO L462 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2019-12-18 19:27:01,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2019-12-18 19:27:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:01,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:01,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:01,221 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-18 19:27:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665119, now seen corresponding path program 4 times [2019-12-18 19:27:01,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:01,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445627703] [2019-12-18 19:27:01,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:01,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445627703] [2019-12-18 19:27:01,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:01,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:01,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620892319] [2019-12-18 19:27:01,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:27:01,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:01,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:27:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:27:01,795 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2019-12-18 19:27:02,857 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-12-18 19:27:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:04,944 INFO L93 Difference]: Finished difference Result 8491 states and 27602 transitions. [2019-12-18 19:27:04,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:27:04,945 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:04,958 INFO L225 Difference]: With dead ends: 8491 [2019-12-18 19:27:04,958 INFO L226 Difference]: Without dead ends: 8491 [2019-12-18 19:27:04,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-18 19:27:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 5468. [2019-12-18 19:27:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2019-12-18 19:27:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 17489 transitions. [2019-12-18 19:27:05,055 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 17489 transitions. Word has length 27 [2019-12-18 19:27:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:05,055 INFO L462 AbstractCegarLoop]: Abstraction has 5468 states and 17489 transitions. [2019-12-18 19:27:05,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 17489 transitions. [2019-12-18 19:27:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:05,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:05,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:05,062 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-18 19:27:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665118, now seen corresponding path program 2 times [2019-12-18 19:27:05,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:05,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927932942] [2019-12-18 19:27:05,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:05,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927932942] [2019-12-18 19:27:05,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:05,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:05,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919775182] [2019-12-18 19:27:05,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:27:05,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:27:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:27:05,627 INFO L87 Difference]: Start difference. First operand 5468 states and 17489 transitions. Second operand 15 states. [2019-12-18 19:27:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:09,204 INFO L93 Difference]: Finished difference Result 8491 states and 27482 transitions. [2019-12-18 19:27:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:27:09,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:09,216 INFO L225 Difference]: With dead ends: 8491 [2019-12-18 19:27:09,216 INFO L226 Difference]: Without dead ends: 8491 [2019-12-18 19:27:09,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2019-12-18 19:27:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 4739. [2019-12-18 19:27:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-18 19:27:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-18 19:27:09,294 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-18 19:27:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:09,294 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-18 19:27:09,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-18 19:27:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:09,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:09,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:09,301 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-18 19:27:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 14057405, now seen corresponding path program 5 times [2019-12-18 19:27:09,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:09,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397461733] [2019-12-18 19:27:09,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:09,677 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-18 19:27:09,804 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-18 19:27:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:10,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397461733] [2019-12-18 19:27:10,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:10,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:10,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422682178] [2019-12-18 19:27:10,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:27:10,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:27:10,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:27:10,037 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-18 19:27:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:12,942 INFO L93 Difference]: Finished difference Result 6594 states and 21127 transitions. [2019-12-18 19:27:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:27:12,942 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:12,952 INFO L225 Difference]: With dead ends: 6594 [2019-12-18 19:27:12,952 INFO L226 Difference]: Without dead ends: 6594 [2019-12-18 19:27:12,953 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-18 19:27:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2019-12-18 19:27:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4739. [2019-12-18 19:27:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-18 19:27:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2019-12-18 19:27:13,064 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2019-12-18 19:27:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:13,064 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2019-12-18 19:27:13,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2019-12-18 19:27:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:13,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:13,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:13,069 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-18 19:27:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775101, now seen corresponding path program 6 times [2019-12-18 19:27:13,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:13,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717896527] [2019-12-18 19:27:13,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:13,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717896527] [2019-12-18 19:27:13,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:13,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 19:27:13,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473148338] [2019-12-18 19:27:13,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 19:27:13,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 19:27:13,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:27:13,682 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2019-12-18 19:27:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:16,098 INFO L93 Difference]: Finished difference Result 6784 states and 21677 transitions. [2019-12-18 19:27:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:27:16,098 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 19:27:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:16,108 INFO L225 Difference]: With dead ends: 6784 [2019-12-18 19:27:16,108 INFO L226 Difference]: Without dead ends: 6784 [2019-12-18 19:27:16,109 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-18 19:27:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-12-18 19:27:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 4049. [2019-12-18 19:27:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-18 19:27:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12935 transitions. [2019-12-18 19:27:16,173 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12935 transitions. Word has length 27 [2019-12-18 19:27:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:16,174 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12935 transitions. [2019-12-18 19:27:16,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 19:27:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12935 transitions. [2019-12-18 19:27:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:16,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:16,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:16,178 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-18 19:27:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:16,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907358, now seen corresponding path program 7 times [2019-12-18 19:27:16,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:16,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593011377] [2019-12-18 19:27:16,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:16,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593011377] [2019-12-18 19:27:16,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:16,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:16,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761893491] [2019-12-18 19:27:16,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:16,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:16,823 INFO L87 Difference]: Start difference. First operand 4049 states and 12935 transitions. Second operand 16 states. [2019-12-18 19:27:18,217 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-18 19:27:18,508 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 19:27:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:20,037 INFO L93 Difference]: Finished difference Result 5954 states and 19287 transitions. [2019-12-18 19:27:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:20,038 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:20,046 INFO L225 Difference]: With dead ends: 5954 [2019-12-18 19:27:20,046 INFO L226 Difference]: Without dead ends: 5954 [2019-12-18 19:27:20,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:27:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-12-18 19:27:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 4739. [2019-12-18 19:27:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-18 19:27:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15273 transitions. [2019-12-18 19:27:20,120 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15273 transitions. Word has length 27 [2019-12-18 19:27:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:20,120 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 15273 transitions. [2019-12-18 19:27:20,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15273 transitions. [2019-12-18 19:27:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:27:20,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:20,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:20,125 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-18 19:27:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907357, now seen corresponding path program 2 times [2019-12-18 19:27:20,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:20,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083709935] [2019-12-18 19:27:20,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:20,661 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-12-18 19:27:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:20,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083709935] [2019-12-18 19:27:20,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:20,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 19:27:20,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206216564] [2019-12-18 19:27:20,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:27:20,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:20,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:27:20,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:27:20,918 INFO L87 Difference]: Start difference. First operand 4739 states and 15273 transitions. Second operand 16 states. [2019-12-18 19:27:22,009 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 19:27:22,289 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 19:27:22,568 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 19:27:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:24,173 INFO L93 Difference]: Finished difference Result 5954 states and 19167 transitions. [2019-12-18 19:27:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:24,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 19:27:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:24,182 INFO L225 Difference]: With dead ends: 5954 [2019-12-18 19:27:24,182 INFO L226 Difference]: Without dead ends: 5954 [2019-12-18 19:27:24,182 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-18 19:27:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-12-18 19:27:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3549. [2019-12-18 19:27:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-18 19:27:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-18 19:27:24,237 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-18 19:27:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:24,237 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-18 19:27:24,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:27:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-18 19:27:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:24,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:24,240 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-18 19:27:24,240 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-18 19:27:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash 399516870, now seen corresponding path program 1 times [2019-12-18 19:27:24,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:24,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285729510] [2019-12-18 19:27:24,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:24,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285729510] [2019-12-18 19:27:24,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:24,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:27:24,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381397537] [2019-12-18 19:27:24,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:27:24,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:27:24,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:27:24,635 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 14 states. [2019-12-18 19:27:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:26,171 INFO L93 Difference]: Finished difference Result 9170 states and 29857 transitions. [2019-12-18 19:27:26,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:27:26,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-12-18 19:27:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:26,186 INFO L225 Difference]: With dead ends: 9170 [2019-12-18 19:27:26,186 INFO L226 Difference]: Without dead ends: 9170 [2019-12-18 19:27:26,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:27:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2019-12-18 19:27:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 7476. [2019-12-18 19:27:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-18 19:27:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24796 transitions. [2019-12-18 19:27:26,303 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24796 transitions. Word has length 30 [2019-12-18 19:27:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:26,304 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24796 transitions. [2019-12-18 19:27:26,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:27:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24796 transitions. [2019-12-18 19:27:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:26,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:26,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:27:26,310 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-18 19:27:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1461784035, now seen corresponding path program 1 times [2019-12-18 19:27:26,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:26,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492411577] [2019-12-18 19:27:26,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:27,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492411577] [2019-12-18 19:27:27,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:27,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 19:27:27,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200147508] [2019-12-18 19:27:27,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:27:27,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:27:27,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:27:27,116 INFO L87 Difference]: Start difference. First operand 7476 states and 24796 transitions. Second operand 18 states. [2019-12-18 19:27:27,607 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-18 19:27:27,797 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-18 19:27:28,054 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-18 19:27:28,476 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-12-18 19:27:29,054 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-18 19:27:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:31,497 INFO L93 Difference]: Finished difference Result 9691 states and 31784 transitions. [2019-12-18 19:27:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:27:31,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-18 19:27:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:31,512 INFO L225 Difference]: With dead ends: 9691 [2019-12-18 19:27:31,512 INFO L226 Difference]: Without dead ends: 9691 [2019-12-18 19:27:31,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:27:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-18 19:27:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 7916. [2019-12-18 19:27:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7916 states. [2019-12-18 19:27:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 26136 transitions. [2019-12-18 19:27:31,619 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 26136 transitions. Word has length 30 [2019-12-18 19:27:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:31,620 INFO L462 AbstractCegarLoop]: Abstraction has 7916 states and 26136 transitions. [2019-12-18 19:27:31,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:27:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 26136 transitions. [2019-12-18 19:27:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:31,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:31,627 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-18 19:27:31,627 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-18 19:27:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1491245864, now seen corresponding path program 2 times [2019-12-18 19:27:31,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:31,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971697215] [2019-12-18 19:27:31,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27: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-18 19:27:32,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971697215] [2019-12-18 19:27:32,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:32,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 19:27:32,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521643781] [2019-12-18 19:27:32,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:27:32,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:27:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:27:32,418 INFO L87 Difference]: Start difference. First operand 7916 states and 26136 transitions. Second operand 19 states. [2019-12-18 19:27:32,839 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-12-18 19:27:33,176 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 19:27:33,339 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-12-18 19:27:33,607 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 19:27:33,885 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-18 19:27:34,420 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2019-12-18 19:27:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:37,548 INFO L93 Difference]: Finished difference Result 11695 states and 38094 transitions. [2019-12-18 19:27:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 19:27:37,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 19:27:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:37,565 INFO L225 Difference]: With dead ends: 11695 [2019-12-18 19:27:37,565 INFO L226 Difference]: Without dead ends: 11695 [2019-12-18 19:27:37,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 19:27:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2019-12-18 19:27:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 8606. [2019-12-18 19:27:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8606 states. [2019-12-18 19:27:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 28226 transitions. [2019-12-18 19:27:37,686 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 28226 transitions. Word has length 30 [2019-12-18 19:27:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:37,686 INFO L462 AbstractCegarLoop]: Abstraction has 8606 states and 28226 transitions. [2019-12-18 19:27:37,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:27:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 28226 transitions. [2019-12-18 19:27:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:37,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:37,694 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-18 19:27:37,695 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-18 19:27:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash -674363086, now seen corresponding path program 3 times [2019-12-18 19:27:37,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:37,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087371935] [2019-12-18 19:27:37,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:37,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-18 19:27:37,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087371935] [2019-12-18 19:27:37,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:37,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:27:37,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493093727] [2019-12-18 19:27:37,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:27:37,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:27:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:27:37,978 INFO L87 Difference]: Start difference. First operand 8606 states and 28226 transitions. Second operand 13 states. [2019-12-18 19:27:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:40,541 INFO L93 Difference]: Finished difference Result 16343 states and 53192 transitions. [2019-12-18 19:27:40,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 19:27:40,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-18 19:27:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:40,566 INFO L225 Difference]: With dead ends: 16343 [2019-12-18 19:27:40,567 INFO L226 Difference]: Without dead ends: 16343 [2019-12-18 19:27:40,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:27:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16343 states. [2019-12-18 19:27:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16343 to 8766. [2019-12-18 19:27:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-18 19:27:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 28719 transitions. [2019-12-18 19:27:40,717 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 28719 transitions. Word has length 30 [2019-12-18 19:27:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:40,718 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 28719 transitions. [2019-12-18 19:27:40,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:27:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 28719 transitions. [2019-12-18 19:27:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:40,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:40,726 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-18 19:27:40,726 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-18 19:27:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1889101151, now seen corresponding path program 2 times [2019-12-18 19:27:40,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:40,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702602347] [2019-12-18 19:27:40,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:41,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702602347] [2019-12-18 19:27:41,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:41,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 19:27:41,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414207699] [2019-12-18 19:27:41,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:27:41,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:27:41,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:27:41,645 INFO L87 Difference]: Start difference. First operand 8766 states and 28719 transitions. Second operand 20 states. [2019-12-18 19:27:42,150 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-18 19:27:42,432 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 19:27:42,613 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-18 19:27:42,845 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-18 19:27:43,092 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-12-18 19:27:43,544 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-18 19:27:45,583 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-12-18 19:27:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:46,681 INFO L93 Difference]: Finished difference Result 13845 states and 45415 transitions. [2019-12-18 19:27:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 19:27:46,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-18 19:27:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:46,709 INFO L225 Difference]: With dead ends: 13845 [2019-12-18 19:27:46,709 INFO L226 Difference]: Without dead ends: 13845 [2019-12-18 19:27:46,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=275, Invalid=1131, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 19:27:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13845 states. [2019-12-18 19:27:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13845 to 8766. [2019-12-18 19:27:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-18 19:27:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 28719 transitions. [2019-12-18 19:27:46,863 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 28719 transitions. Word has length 30 [2019-12-18 19:27:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:46,863 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 28719 transitions. [2019-12-18 19:27:46,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:27:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 28719 transitions. [2019-12-18 19:27:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:46,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:46,873 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-18 19:27:46,873 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-18 19:27:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1617209505, now seen corresponding path program 3 times [2019-12-18 19:27:46,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:46,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424903465] [2019-12-18 19:27:46,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:47,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424903465] [2019-12-18 19:27:47,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:47,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:27:47,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752857562] [2019-12-18 19:27:47,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:27:47,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:47,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:27:47,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:27:47,133 INFO L87 Difference]: Start difference. First operand 8766 states and 28719 transitions. Second operand 12 states. [2019-12-18 19:27:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:49,330 INFO L93 Difference]: Finished difference Result 18715 states and 61217 transitions. [2019-12-18 19:27:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:27:49,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-18 19:27:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:49,366 INFO L225 Difference]: With dead ends: 18715 [2019-12-18 19:27:49,367 INFO L226 Difference]: Without dead ends: 18715 [2019-12-18 19:27:49,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-12-18 19:27:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2019-12-18 19:27:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 11665. [2019-12-18 19:27:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11665 states. [2019-12-18 19:27:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11665 states to 11665 states and 38711 transitions. [2019-12-18 19:27:49,549 INFO L78 Accepts]: Start accepts. Automaton has 11665 states and 38711 transitions. Word has length 30 [2019-12-18 19:27:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:49,549 INFO L462 AbstractCegarLoop]: Abstraction has 11665 states and 38711 transitions. [2019-12-18 19:27:49,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:27:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 11665 states and 38711 transitions. [2019-12-18 19:27:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:49,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:49,562 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-18 19:27:49,563 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-18 19:27:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash -980323325, now seen corresponding path program 4 times [2019-12-18 19:27:49,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:49,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327633706] [2019-12-18 19:27:49,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:50,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327633706] [2019-12-18 19:27:50,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:50,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 19:27:50,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433400148] [2019-12-18 19:27:50,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:27:50,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:27:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:27:50,336 INFO L87 Difference]: Start difference. First operand 11665 states and 38711 transitions. Second operand 18 states. [2019-12-18 19:27:50,838 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-18 19:27:51,184 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 19:27:51,458 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-18 19:27:51,984 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-18 19:27:53,936 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-12-18 19:27:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:27:55,397 INFO L93 Difference]: Finished difference Result 16258 states and 54181 transitions. [2019-12-18 19:27:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:27:55,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-18 19:27:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:27:55,422 INFO L225 Difference]: With dead ends: 16258 [2019-12-18 19:27:55,422 INFO L226 Difference]: Without dead ends: 16258 [2019-12-18 19:27:55,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 19:27:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16258 states. [2019-12-18 19:27:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16258 to 10703. [2019-12-18 19:27:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10703 states. [2019-12-18 19:27:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10703 states to 10703 states and 35787 transitions. [2019-12-18 19:27:55,589 INFO L78 Accepts]: Start accepts. Automaton has 10703 states and 35787 transitions. Word has length 30 [2019-12-18 19:27:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:27:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 10703 states and 35787 transitions. [2019-12-18 19:27:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:27:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 10703 states and 35787 transitions. [2019-12-18 19:27:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:27:55,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:27:55,599 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-18 19:27:55,599 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-18 19:27:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:27:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash 784664900, now seen corresponding path program 4 times [2019-12-18 19:27:55,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:27:55,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193978383] [2019-12-18 19:27:55,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:27:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:27:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:27:56,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193978383] [2019-12-18 19:27:56,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:27:56,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 19:27:56,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481209577] [2019-12-18 19:27:56,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:27:56,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:27:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:27:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:27:56,440 INFO L87 Difference]: Start difference. First operand 10703 states and 35787 transitions. Second operand 19 states. [2019-12-18 19:27:56,873 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-18 19:27:57,191 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-18 19:27:57,477 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-18 19:27:57,751 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-12-18 19:27:58,286 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2019-12-18 19:27:58,630 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 19:28:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:01,460 INFO L93 Difference]: Finished difference Result 15068 states and 50426 transitions. [2019-12-18 19:28:01,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:28:01,461 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 19:28:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:01,484 INFO L225 Difference]: With dead ends: 15068 [2019-12-18 19:28:01,485 INFO L226 Difference]: Without dead ends: 15068 [2019-12-18 19:28:01,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 19:28:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15068 states. [2019-12-18 19:28:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15068 to 9523. [2019-12-18 19:28:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9523 states. [2019-12-18 19:28:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9523 states to 9523 states and 32062 transitions. [2019-12-18 19:28:01,640 INFO L78 Accepts]: Start accepts. Automaton has 9523 states and 32062 transitions. Word has length 30 [2019-12-18 19:28:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:01,640 INFO L462 AbstractCegarLoop]: Abstraction has 9523 states and 32062 transitions. [2019-12-18 19:28:01,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:28:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 9523 states and 32062 transitions. [2019-12-18 19:28:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:28:01,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:01,652 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-18 19:28:01,652 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-18 19:28:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash -838148739, now seen corresponding path program 1 times [2019-12-18 19:28:01,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:01,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30240620] [2019-12-18 19:28:01,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:02,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30240620] [2019-12-18 19:28:02,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:02,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 19:28:02,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863949401] [2019-12-18 19:28:02,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:28:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:28:02,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:28:02,396 INFO L87 Difference]: Start difference. First operand 9523 states and 32062 transitions. Second operand 18 states. [2019-12-18 19:28:03,698 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-18 19:28:03,859 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-18 19:28:04,005 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 19:28:04,361 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-18 19:28:04,535 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 19:28:04,740 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-18 19:28:05,043 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-12-18 19:28:05,215 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-18 19:28:05,399 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-18 19:28:05,885 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-12-18 19:28:06,081 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 19:28:06,551 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-18 19:28:06,752 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-12-18 19:28:07,696 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-18 19:28:07,956 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 19:28:08,115 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-18 19:28:08,437 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-12-18 19:28:08,616 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-18 19:28:08,798 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-18 19:28:09,071 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-18 19:28:09,284 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-18 19:28:09,491 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 19:28:09,871 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-18 19:28:10,118 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-18 19:28:10,373 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-18 19:28:10,601 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-12-18 19:28:10,856 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-12-18 19:28:11,088 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-18 19:28:11,404 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-12-18 19:28:11,684 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-18 19:28:12,016 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-18 19:28:12,288 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-18 19:28:12,790 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-12-18 19:28:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:13,131 INFO L93 Difference]: Finished difference Result 10433 states and 34812 transitions. [2019-12-18 19:28:13,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 19:28:13,131 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-12-18 19:28:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:13,146 INFO L225 Difference]: With dead ends: 10433 [2019-12-18 19:28:13,147 INFO L226 Difference]: Without dead ends: 10433 [2019-12-18 19:28:13,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1093, Invalid=2689, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 19:28:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10433 states. [2019-12-18 19:28:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10433 to 10073. [2019-12-18 19:28:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10073 states. [2019-12-18 19:28:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 33752 transitions. [2019-12-18 19:28:13,275 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 33752 transitions. Word has length 31 [2019-12-18 19:28:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 10073 states and 33752 transitions. [2019-12-18 19:28:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:28:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 33752 transitions. [2019-12-18 19:28:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:28:13,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:13,285 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-18 19:28:13,285 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-18 19:28:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1965024921, now seen corresponding path program 2 times [2019-12-18 19:28:13,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:13,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819655000] [2019-12-18 19:28:13,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:14,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819655000] [2019-12-18 19:28:14,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:14,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 19:28:14,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145896758] [2019-12-18 19:28:14,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:28:14,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:14,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:28:14,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:28:14,121 INFO L87 Difference]: Start difference. First operand 10073 states and 33752 transitions. Second operand 19 states. [2019-12-18 19:28:15,138 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-12-18 19:28:15,284 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-12-18 19:28:15,453 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-18 19:28:15,852 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-18 19:28:16,016 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-18 19:28:16,166 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-12-18 19:28:16,571 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-12-18 19:28:16,749 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-18 19:28:17,243 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 19:28:17,429 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-18 19:28:17,617 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-12-18 19:28:18,146 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-12-18 19:28:18,352 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-18 19:28:18,865 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-18 19:28:19,072 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-12-18 19:28:20,199 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-12-18 19:28:20,465 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 19:28:20,626 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-18 19:28:20,817 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 19:28:21,148 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-18 19:28:21,344 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-18 19:28:21,577 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-18 19:28:21,768 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-18 19:28:22,042 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-18 19:28:22,264 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-12-18 19:28:22,487 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 19:28:22,886 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-18 19:28:23,138 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-18 19:28:23,354 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-18 19:28:23,584 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-12-18 19:28:23,857 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-12-18 19:28:24,101 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-12-18 19:28:24,407 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2019-12-18 19:28:24,701 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-18 19:28:25,037 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-12-18 19:28:25,333 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-12-18 19:28:25,833 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-12-18 19:28:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:26,158 INFO L93 Difference]: Finished difference Result 10623 states and 35402 transitions. [2019-12-18 19:28:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 19:28:26,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 19:28:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:26,174 INFO L225 Difference]: With dead ends: 10623 [2019-12-18 19:28:26,174 INFO L226 Difference]: Without dead ends: 10623 [2019-12-18 19:28:26,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1275, Invalid=3417, Unknown=0, NotChecked=0, Total=4692 [2019-12-18 19:28:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10623 states. [2019-12-18 19:28:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10623 to 10033. [2019-12-18 19:28:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10033 states. [2019-12-18 19:28:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10033 states to 10033 states and 33632 transitions. [2019-12-18 19:28:26,305 INFO L78 Accepts]: Start accepts. Automaton has 10033 states and 33632 transitions. Word has length 31 [2019-12-18 19:28:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:26,305 INFO L462 AbstractCegarLoop]: Abstraction has 10033 states and 33632 transitions. [2019-12-18 19:28:26,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:28:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 10033 states and 33632 transitions. [2019-12-18 19:28:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:28:26,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:26,315 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-18 19:28:26,315 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-18 19:28:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash 288220857, now seen corresponding path program 3 times [2019-12-18 19:28:26,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:26,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386367924] [2019-12-18 19:28:26,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:26,580 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-12-18 19:28:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:27,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386367924] [2019-12-18 19:28:27,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:27,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 19:28:27,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558146248] [2019-12-18 19:28:27,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:28:27,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:28:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:28:27,273 INFO L87 Difference]: Start difference. First operand 10033 states and 33632 transitions. Second operand 19 states. [2019-12-18 19:28:28,448 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-18 19:28:28,993 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-18 19:28:29,165 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-18 19:28:29,323 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-18 19:28:29,737 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-12-18 19:28:29,927 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-12-18 19:28:30,097 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-12-18 19:28:30,558 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 19:28:30,752 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-12-18 19:28:30,945 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-18 19:28:31,110 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 19:28:31,600 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-18 19:28:31,815 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-12-18 19:28:32,007 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 19:28:32,635 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-18 19:28:32,913 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-18 19:28:33,125 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-18 19:28:33,327 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-12-18 19:28:33,884 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-18 19:28:34,097 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-12-18 19:28:34,661 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-12-18 19:28:34,887 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-18 19:28:35,451 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2019-12-18 19:28:35,995 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 19:28:37,932 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-18 19:28:38,262 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-18 19:28:38,504 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2019-12-18 19:28:38,928 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-12-18 19:28:39,178 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 19:28:39,672 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-12-18 19:28:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:40,169 INFO L93 Difference]: Finished difference Result 13018 states and 43428 transitions. [2019-12-18 19:28:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 19:28:40,170 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 19:28:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:40,189 INFO L225 Difference]: With dead ends: 13018 [2019-12-18 19:28:40,189 INFO L226 Difference]: Without dead ends: 13018 [2019-12-18 19:28:40,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1074, Invalid=3482, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 19:28:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13018 states. [2019-12-18 19:28:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13018 to 10769. [2019-12-18 19:28:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10769 states. [2019-12-18 19:28:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10769 states to 10769 states and 36006 transitions. [2019-12-18 19:28:40,344 INFO L78 Accepts]: Start accepts. Automaton has 10769 states and 36006 transitions. Word has length 31 [2019-12-18 19:28:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:40,345 INFO L462 AbstractCegarLoop]: Abstraction has 10769 states and 36006 transitions. [2019-12-18 19:28:40,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:28:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10769 states and 36006 transitions. [2019-12-18 19:28:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:28:40,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:40,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:28:40,355 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-18 19:28:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 288220858, now seen corresponding path program 1 times [2019-12-18 19:28:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904564705] [2019-12-18 19:28:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:41,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904564705] [2019-12-18 19:28:41,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:41,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 19:28:41,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045452509] [2019-12-18 19:28:41,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:28:41,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:41,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:28:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:28:41,163 INFO L87 Difference]: Start difference. First operand 10769 states and 36006 transitions. Second operand 19 states. [2019-12-18 19:28:42,055 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-12-18 19:28:42,195 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-12-18 19:28:42,681 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-18 19:28:42,852 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-12-18 19:28:42,998 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-12-18 19:28:43,367 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-18 19:28:43,542 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-18 19:28:44,112 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-12-18 19:28:44,298 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-18 19:28:44,481 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-18 19:28:45,090 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-12-18 19:28:45,290 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-18 19:28:45,747 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-12-18 19:28:45,954 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-18 19:28:46,973 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-18 19:28:47,210 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 19:28:47,356 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 19:28:47,811 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-18 19:28:47,995 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-18 19:28:48,176 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-18 19:28:48,361 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-18 19:28:48,620 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-18 19:28:48,845 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-18 19:28:49,049 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-18 19:28:49,409 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-18 19:28:49,666 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-18 19:28:49,867 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 19:28:50,026 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-18 19:28:50,226 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-18 19:28:50,496 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-18 19:28:50,732 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-18 19:28:51,051 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-12-18 19:28:51,418 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-12-18 19:28:51,731 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-12-18 19:28:52,024 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-12-18 19:28:52,451 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2019-12-18 19:28:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:28:52,647 INFO L93 Difference]: Finished difference Result 10841 states and 36198 transitions. [2019-12-18 19:28:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 19:28:52,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 19:28:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:28:52,663 INFO L225 Difference]: With dead ends: 10841 [2019-12-18 19:28:52,663 INFO L226 Difference]: Without dead ends: 10841 [2019-12-18 19:28:52,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1376, Invalid=3594, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 19:28:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10841 states. [2019-12-18 19:28:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10841 to 10571. [2019-12-18 19:28:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10571 states. [2019-12-18 19:28:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10571 states to 10571 states and 35408 transitions. [2019-12-18 19:28:52,799 INFO L78 Accepts]: Start accepts. Automaton has 10571 states and 35408 transitions. Word has length 31 [2019-12-18 19:28:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:28:52,799 INFO L462 AbstractCegarLoop]: Abstraction has 10571 states and 35408 transitions. [2019-12-18 19:28:52,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:28:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 10571 states and 35408 transitions. [2019-12-18 19:28:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:28:52,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:28:52,809 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-18 19:28:52,809 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-18 19:28:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:28:52,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1133622845, now seen corresponding path program 4 times [2019-12-18 19:28:52,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:28:52,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767713732] [2019-12-18 19:28:52,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:28:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:28:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:28:53,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767713732] [2019-12-18 19:28:53,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:28:53,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 19:28:53,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398383377] [2019-12-18 19:28:53,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:28:53,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:28:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:28:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:28:53,862 INFO L87 Difference]: Start difference. First operand 10571 states and 35408 transitions. Second operand 20 states. [2019-12-18 19:28:55,544 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-18 19:28:55,728 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-12-18 19:28:56,098 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 19:28:56,325 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 19:28:56,540 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-18 19:28:56,736 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-12-18 19:28:57,032 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-12-18 19:28:57,428 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 19:28:57,665 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-12-18 19:28:58,267 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 19:28:58,471 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-12-18 19:28:58,760 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-12-18 19:28:59,319 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-18 19:28:59,580 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-12-18 19:29:00,242 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-12-18 19:29:00,464 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-18 19:29:01,701 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-12-18 19:29:02,568 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 19:29:02,732 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-12-18 19:29:02,932 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-18 19:29:03,251 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-18 19:29:03,451 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-18 19:29:03,652 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-12-18 19:29:03,882 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-18 19:29:04,147 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 19:29:04,602 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-12-18 19:29:04,850 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2019-12-18 19:29:05,141 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-12-18 19:29:05,440 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-18 19:29:05,732 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-12-18 19:29:05,968 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-18 19:29:06,268 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 19:29:06,554 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2019-12-18 19:29:06,817 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-18 19:29:07,189 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2019-12-18 19:29:07,522 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-12-18 19:29:07,918 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2019-12-18 19:29:08,373 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-12-18 19:29:09,020 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72 [2019-12-18 19:29:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:09,637 INFO L93 Difference]: Finished difference Result 13980 states and 45749 transitions. [2019-12-18 19:29:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-18 19:29:09,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-18 19:29:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:09,656 INFO L225 Difference]: With dead ends: 13980 [2019-12-18 19:29:09,656 INFO L226 Difference]: Without dead ends: 13980 [2019-12-18 19:29:09,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1798, Invalid=5342, Unknown=0, NotChecked=0, Total=7140 [2019-12-18 19:29:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2019-12-18 19:29:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 11287. [2019-12-18 19:29:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11287 states. [2019-12-18 19:29:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11287 states to 11287 states and 37640 transitions. [2019-12-18 19:29:09,815 INFO L78 Accepts]: Start accepts. Automaton has 11287 states and 37640 transitions. Word has length 31 [2019-12-18 19:29:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:09,815 INFO L462 AbstractCegarLoop]: Abstraction has 11287 states and 37640 transitions. [2019-12-18 19:29:09,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:29:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11287 states and 37640 transitions. [2019-12-18 19:29:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:29:09,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:09,825 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-18 19:29:09,826 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-18 19:29:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1257314425, now seen corresponding path program 5 times [2019-12-18 19:29:09,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:09,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299102788] [2019-12-18 19:29:09,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:10,550 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-12-18 19:29:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:10,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299102788] [2019-12-18 19:29:10,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:10,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 19:29:10,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908331829] [2019-12-18 19:29:10,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:29:10,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:10,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:29:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:29:10,830 INFO L87 Difference]: Start difference. First operand 11287 states and 37640 transitions. Second operand 20 states. [2019-12-18 19:29:12,688 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 19:29:13,216 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-18 19:29:13,419 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-18 19:29:13,818 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-18 19:29:13,992 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-12-18 19:29:14,570 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-18 19:29:15,129 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-12-18 19:29:16,668 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-18 19:29:16,840 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-18 19:29:17,014 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-12-18 19:29:17,152 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-12-18 19:29:17,528 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-18 19:29:17,741 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-12-18 19:29:17,946 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-18 19:29:18,192 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-12-18 19:29:18,383 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-18 19:29:18,665 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-18 19:29:18,880 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-12-18 19:29:19,088 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-18 19:29:19,314 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-12-18 19:29:19,691 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-12-18 19:29:19,924 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-18 19:29:20,163 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-12-18 19:29:20,364 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-18 19:29:20,692 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-12-18 19:29:20,936 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-12-18 19:29:21,188 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-18 19:29:21,547 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-12-18 19:29:21,818 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-12-18 19:29:22,048 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-12-18 19:29:22,602 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-12-18 19:29:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:22,945 INFO L93 Difference]: Finished difference Result 13232 states and 43437 transitions. [2019-12-18 19:29:22,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 19:29:22,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-18 19:29:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:22,964 INFO L225 Difference]: With dead ends: 13232 [2019-12-18 19:29:22,964 INFO L226 Difference]: Without dead ends: 13232 [2019-12-18 19:29:22,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1327, Invalid=3643, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 19:29:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13232 states. [2019-12-18 19:29:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13232 to 11427. [2019-12-18 19:29:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11427 states. [2019-12-18 19:29:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11427 states to 11427 states and 38020 transitions. [2019-12-18 19:29:23,120 INFO L78 Accepts]: Start accepts. Automaton has 11427 states and 38020 transitions. Word has length 31 [2019-12-18 19:29:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:23,121 INFO L462 AbstractCegarLoop]: Abstraction has 11427 states and 38020 transitions. [2019-12-18 19:29:23,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:29:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11427 states and 38020 transitions. [2019-12-18 19:29:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:29:23,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:23,132 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-18 19:29:23,132 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-18 19:29:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1263078073, now seen corresponding path program 6 times [2019-12-18 19:29:23,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:23,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722805383] [2019-12-18 19:29:23,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:24,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722805383] [2019-12-18 19:29:24,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:24,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 19:29:24,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450553637] [2019-12-18 19:29:24,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:29:24,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:29:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:29:24,052 INFO L87 Difference]: Start difference. First operand 11427 states and 38020 transitions. Second operand 20 states. [2019-12-18 19:29:25,489 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-18 19:29:26,035 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-18 19:29:27,109 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-18 19:29:27,272 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-18 19:29:27,460 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 19:29:27,643 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-18 19:29:27,802 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-18 19:29:28,034 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-18 19:29:28,248 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-18 19:29:28,441 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 19:29:28,726 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-12-18 19:29:28,940 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-18 19:29:29,151 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-18 19:29:29,359 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-12-18 19:29:29,615 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-12-18 19:29:29,844 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-12-18 19:29:30,168 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-18 19:29:30,415 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-12-18 19:29:30,749 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-12-18 19:29:30,986 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-12-18 19:29:31,485 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-18 19:29:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:31,861 INFO L93 Difference]: Finished difference Result 13166 states and 43235 transitions. [2019-12-18 19:29:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 19:29:31,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-18 19:29:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:31,878 INFO L225 Difference]: With dead ends: 13166 [2019-12-18 19:29:31,878 INFO L226 Difference]: Without dead ends: 13166 [2019-12-18 19:29:31,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=719, Invalid=1831, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 19:29:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2019-12-18 19:29:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 11373. [2019-12-18 19:29:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2019-12-18 19:29:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 37854 transitions. [2019-12-18 19:29:32,014 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 37854 transitions. Word has length 31 [2019-12-18 19:29:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:32,014 INFO L462 AbstractCegarLoop]: Abstraction has 11373 states and 37854 transitions. [2019-12-18 19:29:32,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:29:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 37854 transitions. [2019-12-18 19:29:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:29:32,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:32,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:29:32,024 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-18 19:29:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2096638671, now seen corresponding path program 7 times [2019-12-18 19:29:32,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:32,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758368392] [2019-12-18 19:29:32,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:32,935 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-12-18 19:29:33,148 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 46 [2019-12-18 19:29:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:33,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758368392] [2019-12-18 19:29:33,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:33,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 19:29:33,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804427189] [2019-12-18 19:29:33,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:29:33,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:29:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:29:33,346 INFO L87 Difference]: Start difference. First operand 11373 states and 37854 transitions. Second operand 19 states. [2019-12-18 19:29:35,219 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 19:29:35,427 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 19:29:36,132 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-18 19:29:36,710 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-12-18 19:29:37,238 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-12-18 19:29:38,006 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-12-18 19:29:38,461 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-18 19:29:38,653 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-18 19:29:39,095 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-18 19:29:39,257 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-12-18 19:29:39,565 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-18 19:29:39,849 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-18 19:29:40,245 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-18 19:29:40,603 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-12-18 19:29:40,961 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2019-12-18 19:29:41,414 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 77 [2019-12-18 19:29:41,667 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-12-18 19:29:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:29:41,925 INFO L93 Difference]: Finished difference Result 13191 states and 43298 transitions. [2019-12-18 19:29:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 19:29:41,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 19:29:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:29:41,943 INFO L225 Difference]: With dead ends: 13191 [2019-12-18 19:29:41,944 INFO L226 Difference]: Without dead ends: 13191 [2019-12-18 19:29:41,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=680, Invalid=1770, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 19:29:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13191 states. [2019-12-18 19:29:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13191 to 11433. [2019-12-18 19:29:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2019-12-18 19:29:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 38014 transitions. [2019-12-18 19:29:42,096 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 38014 transitions. Word has length 31 [2019-12-18 19:29:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:29:42,096 INFO L462 AbstractCegarLoop]: Abstraction has 11433 states and 38014 transitions. [2019-12-18 19:29:42,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:29:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 38014 transitions. [2019-12-18 19:29:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 19:29:42,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:29:42,107 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-18 19:29:42,108 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-18 19:29:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:29:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -576884563, now seen corresponding path program 8 times [2019-12-18 19:29:42,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:29:42,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930625332] [2019-12-18 19:29:42,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:29:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:29:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:29:43,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930625332] [2019-12-18 19:29:43,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:29:43,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 19:29:43,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387272066] [2019-12-18 19:29:43,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:29:43,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:29:43,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:29:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:29:43,066 INFO L87 Difference]: Start difference. First operand 11433 states and 38014 transitions. Second operand 19 states. [2019-12-18 19:29:44,864 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-12-18 19:29:45,054 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-18 19:29:45,564 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-12-18 19:29:46,029 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-18 19:29:46,719 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2019-12-18 19:29:46,971 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-18 19:29:47,449 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-18 19:29:47,646 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-12-18 19:29:48,539 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-18 19:29:49,424 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-18 19:29:49,590 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-12-18 19:29:49,889 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-18 19:29:50,149 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-18 19:29:50,359 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-12-18 19:29:50,660 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 Received shutdown request... [2019-12-18 19:29:50,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 19:29:50,773 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 19:29:50,780 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 19:29:50,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:29:50 BasicIcfg [2019-12-18 19:29:50,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:29:50,782 INFO L168 Benchmark]: Toolchain (without parser) took 243267.47 ms. Allocated memory was 142.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 103.6 MB in the beginning and 536.8 MB in the end (delta: -433.3 MB). Peak memory consumption was 816.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,782 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 142.6 MB. Free memory was 124.6 MB in the beginning and 124.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 990.18 ms. Allocated memory was 142.6 MB in the beginning and 206.0 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 127.4 MB in the end (delta: -24.2 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.27 ms. Allocated memory is still 206.0 MB. Free memory was 127.4 MB in the beginning and 124.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,783 INFO L168 Benchmark]: Boogie Preprocessor took 52.09 ms. Allocated memory is still 206.0 MB. Free memory was 124.3 MB in the beginning and 122.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,783 INFO L168 Benchmark]: RCFGBuilder took 804.52 ms. Allocated memory was 206.0 MB in the beginning and 231.2 MB in the end (delta: 25.2 MB). Free memory was 121.8 MB in the beginning and 184.3 MB in the end (delta: -62.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,784 INFO L168 Benchmark]: TraceAbstraction took 241321.03 ms. Allocated memory was 231.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 184.3 MB in the beginning and 536.8 MB in the end (delta: -352.5 MB). Peak memory consumption was 808.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:29:50,785 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 142.6 MB. Free memory was 124.6 MB in the beginning and 124.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 990.18 ms. Allocated memory was 142.6 MB in the beginning and 206.0 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 127.4 MB in the end (delta: -24.2 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.27 ms. Allocated memory is still 206.0 MB. Free memory was 127.4 MB in the beginning and 124.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.09 ms. Allocated memory is still 206.0 MB. Free memory was 124.3 MB in the beginning and 122.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 804.52 ms. Allocated memory was 206.0 MB in the beginning and 231.2 MB in the end (delta: 25.2 MB). Free memory was 121.8 MB in the beginning and 184.3 MB in the end (delta: -62.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241321.03 ms. Allocated memory was 231.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 184.3 MB in the beginning and 536.8 MB in the end (delta: -352.5 MB). Peak memory consumption was 808.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 6 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 118 SemBasedMoverChecksPositive, 118 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 20924 CheckedPairsTotal, 153 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (11433states) and FLOYD_HOARE automaton (currently 35 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (4314 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (11433states) and FLOYD_HOARE automaton (currently 35 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (4314 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (11433states) and FLOYD_HOARE automaton (currently 35 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (4314 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (11433states) and FLOYD_HOARE automaton (currently 35 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (4314 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 241.1s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 200.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2956 SDtfs, 14162 SDslu, 14031 SDs, 0 SdLazy, 85663 SolverSat, 1610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 31 SyntacticMatches, 33 SemanticMatches, 1386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9517 ImplicationChecksByTransitivity, 117.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11665occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 41 MinimizatonAttempts, 90582 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 900901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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