/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:23:52,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:23:52,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:23:52,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:23:52,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:23:52,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:23:52,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:23:52,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:23:52,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:23:52,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:23:52,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:23:52,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:23:52,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:23:52,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:23:52,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:23:52,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:23:52,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:23:52,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:23:52,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:23:52,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:23:52,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:23:52,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:23:52,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:23:52,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:23:52,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:23:52,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:23:52,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:23:52,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:23:52,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:23:52,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:23:52,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:23:52,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:23:52,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:23:52,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:23:52,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:23:52,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:23:52,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:23:52,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:23:52,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:23:52,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:23:52,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:23:52,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:23:52,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:23:52,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:23:52,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:23:52,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:23:52,381 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:23:52,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:23:52,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:23:52,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:23:52,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:23:52,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:23:52,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:23:52,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:23:52,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:23:52,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:23:52,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:23:52,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:23:52,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:23:52,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:23:52,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:23:52,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:23:52,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:23:52,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:23:52,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:23:52,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:23:52,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:23:52,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:23:52,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:23:52,386 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:23:52,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:23:52,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:23:52,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:23:52,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:23:52,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:23:52,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:23:52,665 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:23:52,666 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 23:23:52,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2027d70bc/119c4c1c51de485497438ef08ecfe336/FLAGaa35d048e [2019-12-18 23:23:53,299 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:23:53,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-18 23:23:53,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2027d70bc/119c4c1c51de485497438ef08ecfe336/FLAGaa35d048e [2019-12-18 23:23:53,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2027d70bc/119c4c1c51de485497438ef08ecfe336 [2019-12-18 23:23:53,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:23:53,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:23:53,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:23:53,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:23:53,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:23:53,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:23:53" (1/1) ... [2019-12-18 23:23:53,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663f26a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:53, skipping insertion in model container [2019-12-18 23:23:53,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:23:53" (1/1) ... [2019-12-18 23:23:53,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:23:53,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:23:53,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 23:23:54,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:23:54,321 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:23:54,345 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 23:23:54,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:23:54,630 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:23:54,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54 WrapperNode [2019-12-18 23:23:54,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:23:54,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:23:54,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:23:54,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:23:54,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:23:54,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:23:54,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:23:54,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:23:54,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (1/1) ... [2019-12-18 23:23:54,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:23:54,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:23:54,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:23:54,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:23:54,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (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 23:23:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-18 23:23:54,836 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-18 23:23:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-18 23:23:54,836 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-18 23:23:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:23:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:23:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 23:23:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:23:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 23:23:54,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:23:54,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:23:54,839 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 23:23:55,489 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:23:55,490 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-18 23:23:55,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:23:55 BoogieIcfgContainer [2019-12-18 23:23:55,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:23:55,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:23:55,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:23:55,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:23:55,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:23:53" (1/3) ... [2019-12-18 23:23:55,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82922bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:23:55, skipping insertion in model container [2019-12-18 23:23:55,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:54" (2/3) ... [2019-12-18 23:23:55,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82922bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:23:55, skipping insertion in model container [2019-12-18 23:23:55,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:23:55" (3/3) ... [2019-12-18 23:23:55,500 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-18 23:23:55,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:23:55,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:23:55,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-18 23:23:55,519 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:23:55,562 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,563 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,563 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,563 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,563 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,564 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,564 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,564 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,564 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,564 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,565 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,565 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,565 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,565 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,565 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,570 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,570 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,570 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,570 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,570 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,571 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,575 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,575 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,575 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 23:23:55,575 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 23:23:55,577 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,578 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,579 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,579 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 23:23:55,579 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 23:23:55,579 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,579 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,583 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,583 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 23:23:55,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 23:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,584 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,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 23:23:55,584 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,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 23:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,585 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,585 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 23:23:55,585 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 23:23:55,585 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,585 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,586 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,586 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,586 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,586 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,586 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,587 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,587 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,587 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,587 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,587 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,588 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,588 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,588 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,588 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,588 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,589 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,589 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,589 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,589 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,589 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,590 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,590 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,590 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,590 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,590 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,593 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,593 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,593 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,594 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,594 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,594 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,594 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,595 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,595 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,595 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,595 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,595 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,595 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,596 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,596 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,596 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,596 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,596 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,597 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,597 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,597 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,597 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,597 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,597 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,598 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,598 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,598 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,598 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,598 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,598 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,599 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,599 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,599 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,599 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,600 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,600 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,600 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,600 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,600 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,601 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,601 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,601 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,601 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,601 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,602 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,602 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,602 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,602 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,603 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,603 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,603 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,603 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,603 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,604 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,604 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,604 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,604 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,604 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,605 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,605 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,605 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,605 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,605 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 23:23:55,605 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 23:23:55,605 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,606 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,606 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,606 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,606 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,606 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,607 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,607 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,607 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 23:23:55,607 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 23:23:55,607 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,608 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,608 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,608 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,608 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,608 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,608 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,609 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,609 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,609 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,609 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,609 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,610 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,610 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,610 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,610 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,610 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,610 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,611 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,612 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,612 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,612 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,613 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,613 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,613 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,613 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,613 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,614 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,614 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,614 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,614 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,614 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,618 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,618 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,618 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,619 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,619 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,619 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,619 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,619 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,620 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,620 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,620 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,620 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,620 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,621 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 23:23:55,621 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,621 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,621 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 23:23:55,621 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,627 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,627 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,627 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,627 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,628 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,628 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,628 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,628 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,628 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,629 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 23:23:55,629 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,629 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,629 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,629 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,629 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,630 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,630 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 23:23:55,630 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,630 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,630 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,631 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,631 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,631 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,631 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,631 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,631 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,632 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,632 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,633 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,633 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,633 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,633 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:55,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-18 23:23:55,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:23:55,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:23:55,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:23:55,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:23:55,684 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:23:55,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:23:55,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:23:55,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:23:55,707 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-18 23:23:55,709 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-18 23:23:55,802 INFO L126 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-18 23:23:55,803 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:23:55,819 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 23:23:55,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-18 23:23:55,887 INFO L126 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-18 23:23:55,887 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:23:55,894 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 23:23:55,912 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-18 23:23:55,913 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:23:59,008 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-18 23:23:59,407 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20948 [2019-12-18 23:23:59,407 INFO L214 etLargeBlockEncoding]: Total number of compositions: 149 [2019-12-18 23:23:59,410 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-18 23:23:59,540 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-18 23:23:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-18 23:23:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:23:59,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:59,565 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 23:23:59,565 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 23:23:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash -335056581, now seen corresponding path program 1 times [2019-12-18 23:23:59,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:59,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48576378] [2019-12-18 23:23:59,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:59,987 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 23:23:59,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48576378] [2019-12-18 23:23:59,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:59,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:23:59,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855642585] [2019-12-18 23:23:59,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:23:59,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:24:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:24:00,006 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-18 23:24:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:00,413 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-18 23:24:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:24:00,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 23:24:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:00,450 INFO L225 Difference]: With dead ends: 2169 [2019-12-18 23:24:00,450 INFO L226 Difference]: Without dead ends: 2053 [2019-12-18 23:24:00,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:24:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-18 23:24:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-18 23:24:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-18 23:24:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-18 23:24:00,586 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-18 23:24:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:00,587 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-18 23:24:00,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:24:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-18 23:24:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:24:00,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:00,590 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 23:24:00,591 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 23:24:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 297867655, now seen corresponding path program 1 times [2019-12-18 23:24:00,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:00,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314317112] [2019-12-18 23:24:00,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:00,756 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 23:24:00,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314317112] [2019-12-18 23:24:00,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:00,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:24:00,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814646680] [2019-12-18 23:24:00,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:24:00,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:24:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:24:00,760 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-18 23:24:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:01,445 INFO L93 Difference]: Finished difference Result 3627 states and 11998 transitions. [2019-12-18 23:24:01,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:24:01,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 23:24:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:01,475 INFO L225 Difference]: With dead ends: 3627 [2019-12-18 23:24:01,476 INFO L226 Difference]: Without dead ends: 3587 [2019-12-18 23:24:01,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:24:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2019-12-18 23:24:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 2596. [2019-12-18 23:24:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2596 states. [2019-12-18 23:24:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 8468 transitions. [2019-12-18 23:24:01,580 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 8468 transitions. Word has length 18 [2019-12-18 23:24:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:01,581 INFO L462 AbstractCegarLoop]: Abstraction has 2596 states and 8468 transitions. [2019-12-18 23:24:01,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:24:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 8468 transitions. [2019-12-18 23:24:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:24:01,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:01,586 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 23:24:01,586 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 23:24:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -100749885, now seen corresponding path program 2 times [2019-12-18 23:24:01,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:01,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891647896] [2019-12-18 23:24:01,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:01,750 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 23:24:01,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891647896] [2019-12-18 23:24:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:01,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:24:01,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969175594] [2019-12-18 23:24:01,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:24:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:24:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:24:01,752 INFO L87 Difference]: Start difference. First operand 2596 states and 8468 transitions. Second operand 7 states. [2019-12-18 23:24:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:02,260 INFO L93 Difference]: Finished difference Result 3131 states and 10150 transitions. [2019-12-18 23:24:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:24:02,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 23:24:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:02,286 INFO L225 Difference]: With dead ends: 3131 [2019-12-18 23:24:02,287 INFO L226 Difference]: Without dead ends: 3083 [2019-12-18 23:24:02,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:24:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-12-18 23:24:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2544. [2019-12-18 23:24:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-18 23:24:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-18 23:24:02,427 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-18 23:24:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:02,428 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-18 23:24:02,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:24:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-18 23:24:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:02,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:02,435 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 23:24:02,435 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 23:24:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1794084954, now seen corresponding path program 1 times [2019-12-18 23:24:02,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:02,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286247401] [2019-12-18 23:24:02,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:02,928 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 23:24:02,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286247401] [2019-12-18 23:24:02,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:02,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:24:02,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537478784] [2019-12-18 23:24:02,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:24:02,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:24:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:24:02,931 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 12 states. [2019-12-18 23:24:04,541 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-18 23:24:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:04,769 INFO L93 Difference]: Finished difference Result 3094 states and 10016 transitions. [2019-12-18 23:24:04,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:24:04,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 23:24:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:04,793 INFO L225 Difference]: With dead ends: 3094 [2019-12-18 23:24:04,793 INFO L226 Difference]: Without dead ends: 3094 [2019-12-18 23:24:04,794 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 23:24:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2019-12-18 23:24:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3034. [2019-12-18 23:24:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-18 23:24:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9886 transitions. [2019-12-18 23:24:04,885 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9886 transitions. Word has length 25 [2019-12-18 23:24:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:04,887 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 9886 transitions. [2019-12-18 23:24:04,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:24:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9886 transitions. [2019-12-18 23:24:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:04,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:04,894 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 23:24:04,895 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 23:24:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 683365392, now seen corresponding path program 1 times [2019-12-18 23:24:04,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:04,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571453092] [2019-12-18 23:24:04,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:05,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571453092] [2019-12-18 23:24:05,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:05,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:05,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489969678] [2019-12-18 23:24:05,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:05,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:05,556 INFO L87 Difference]: Start difference. First operand 3034 states and 9886 transitions. Second operand 14 states. [2019-12-18 23:24:07,389 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-12-18 23:24:07,590 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-18 23:24:07,847 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 23:24:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:08,176 INFO L93 Difference]: Finished difference Result 3654 states and 11766 transitions. [2019-12-18 23:24:08,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:08,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:08,201 INFO L225 Difference]: With dead ends: 3654 [2019-12-18 23:24:08,202 INFO L226 Difference]: Without dead ends: 3654 [2019-12-18 23:24:08,202 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 23:24:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-18 23:24:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-18 23:24:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-18 23:24:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-18 23:24:08,302 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-18 23:24:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:08,303 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-18 23:24:08,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-18 23:24:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:08,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:08,312 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 23:24:08,312 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 23:24:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 557439904, now seen corresponding path program 2 times [2019-12-18 23:24:08,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:08,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754866222] [2019-12-18 23:24:08,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:08,897 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 23:24:08,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754866222] [2019-12-18 23:24:08,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:08,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:24:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751811471] [2019-12-18 23:24:08,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:24:08,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:24:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:24:08,899 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 13 states. [2019-12-18 23:24:12,121 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-12-18 23:24:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:12,548 INFO L93 Difference]: Finished difference Result 4574 states and 14569 transitions. [2019-12-18 23:24:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 23:24:12,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-18 23:24:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:12,577 INFO L225 Difference]: With dead ends: 4574 [2019-12-18 23:24:12,577 INFO L226 Difference]: Without dead ends: 4574 [2019-12-18 23:24:12,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2019-12-18 23:24:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-12-18 23:24:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 3594. [2019-12-18 23:24:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-18 23:24:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11569 transitions. [2019-12-18 23:24:12,686 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11569 transitions. Word has length 25 [2019-12-18 23:24:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:12,687 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11569 transitions. [2019-12-18 23:24:12,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:24:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11569 transitions. [2019-12-18 23:24:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:12,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:12,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:12,695 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 23:24:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -963117732, now seen corresponding path program 3 times [2019-12-18 23:24:12,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:12,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244177760] [2019-12-18 23:24:12,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:13,225 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 23:24:13,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244177760] [2019-12-18 23:24:13,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:13,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:24:13,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658567310] [2019-12-18 23:24:13,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:24:13,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:24:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:24:13,227 INFO L87 Difference]: Start difference. First operand 3594 states and 11569 transitions. Second operand 12 states. [2019-12-18 23:24:15,389 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-18 23:24:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:15,713 INFO L93 Difference]: Finished difference Result 4378 states and 13953 transitions. [2019-12-18 23:24:15,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:24:15,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 23:24:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:15,727 INFO L225 Difference]: With dead ends: 4378 [2019-12-18 23:24:15,727 INFO L226 Difference]: Without dead ends: 4378 [2019-12-18 23:24:15,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:24:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2019-12-18 23:24:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 3258. [2019-12-18 23:24:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3258 states. [2019-12-18 23:24:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 10453 transitions. [2019-12-18 23:24:15,818 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 10453 transitions. Word has length 25 [2019-12-18 23:24:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:15,818 INFO L462 AbstractCegarLoop]: Abstraction has 3258 states and 10453 transitions. [2019-12-18 23:24:15,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:24:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 10453 transitions. [2019-12-18 23:24:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:15,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:15,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] [2019-12-18 23:24:15,826 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 23:24:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2139201454, now seen corresponding path program 2 times [2019-12-18 23:24:15,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:15,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280217408] [2019-12-18 23:24:15,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:16,329 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 23:24:16,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280217408] [2019-12-18 23:24:16,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:16,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:16,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072651843] [2019-12-18 23:24:16,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:16,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:16,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:16,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:16,332 INFO L87 Difference]: Start difference. First operand 3258 states and 10453 transitions. Second operand 14 states. [2019-12-18 23:24:18,786 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-12-18 23:24:19,006 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-18 23:24:19,316 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-18 23:24:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:19,702 INFO L93 Difference]: Finished difference Result 4358 states and 13703 transitions. [2019-12-18 23:24:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:24:19,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:19,717 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 23:24:19,717 INFO L226 Difference]: Without dead ends: 4358 [2019-12-18 23:24:19,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:24:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2019-12-18 23:24:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 3188. [2019-12-18 23:24:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-18 23:24:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-18 23:24:19,808 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-18 23:24:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:19,809 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-18 23:24:19,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-18 23:24:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:19,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:19,814 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 23:24:19,815 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 23:24:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash 822898226, now seen corresponding path program 3 times [2019-12-18 23:24:19,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:19,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192767523] [2019-12-18 23:24:19,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:20,400 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 23:24:20,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192767523] [2019-12-18 23:24:20,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:20,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:20,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351030785] [2019-12-18 23:24:20,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:20,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:20,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:20,402 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 14 states. [2019-12-18 23:24:23,056 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-18 23:24:23,350 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-18 23:24:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:23,701 INFO L93 Difference]: Finished difference Result 4158 states and 13103 transitions. [2019-12-18 23:24:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:24:23,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:23,715 INFO L225 Difference]: With dead ends: 4158 [2019-12-18 23:24:23,715 INFO L226 Difference]: Without dead ends: 4158 [2019-12-18 23:24:23,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2019-12-18 23:24:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2019-12-18 23:24:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3118. [2019-12-18 23:24:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-12-18 23:24:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 9973 transitions. [2019-12-18 23:24:23,802 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 9973 transitions. Word has length 25 [2019-12-18 23:24:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:23,802 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 9973 transitions. [2019-12-18 23:24:23,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 9973 transitions. [2019-12-18 23:24:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:24:23,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:23,807 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 23:24:23,808 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 23:24:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1855082980, now seen corresponding path program 4 times [2019-12-18 23:24:23,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:23,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966553934] [2019-12-18 23:24:23,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:24,400 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 23:24:24,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966553934] [2019-12-18 23:24:24,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:24,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:24,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082815350] [2019-12-18 23:24:24,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:24,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:24,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:24,402 INFO L87 Difference]: Start difference. First operand 3118 states and 9973 transitions. Second operand 14 states. [2019-12-18 23:24:27,599 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-18 23:24:27,872 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-12-18 23:24:28,029 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 23:24:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:28,408 INFO L93 Difference]: Finished difference Result 4042 states and 12710 transitions. [2019-12-18 23:24:28,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 23:24:28,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-18 23:24:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:28,415 INFO L225 Difference]: With dead ends: 4042 [2019-12-18 23:24:28,416 INFO L226 Difference]: Without dead ends: 4042 [2019-12-18 23:24:28,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 23:24:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4042 states. [2019-12-18 23:24:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4042 to 2852. [2019-12-18 23:24:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-18 23:24:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-18 23:24:28,488 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-18 23:24:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:28,489 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-18 23:24:28,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-18 23:24:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:28,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:28,494 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 23:24:28,494 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 23:24:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash -753361541, now seen corresponding path program 1 times [2019-12-18 23:24:28,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:28,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350854959] [2019-12-18 23:24:28,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:29,029 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 23:24:29,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350854959] [2019-12-18 23:24:29,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:29,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:24:29,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062238387] [2019-12-18 23:24:29,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:24:29,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:24:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:24:29,031 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 14 states. [2019-12-18 23:24:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:31,225 INFO L93 Difference]: Finished difference Result 4947 states and 15922 transitions. [2019-12-18 23:24:31,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:24:31,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-18 23:24:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:31,234 INFO L225 Difference]: With dead ends: 4947 [2019-12-18 23:24:31,235 INFO L226 Difference]: Without dead ends: 4947 [2019-12-18 23:24:31,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:24:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-12-18 23:24:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4032. [2019-12-18 23:24:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-12-18 23:24:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 12853 transitions. [2019-12-18 23:24:31,334 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 12853 transitions. Word has length 27 [2019-12-18 23:24:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:31,335 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 12853 transitions. [2019-12-18 23:24:31,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:24:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 12853 transitions. [2019-12-18 23:24:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:31,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:31,342 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 23:24:31,342 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 23:24:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -798819684, now seen corresponding path program 1 times [2019-12-18 23:24:31,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:31,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367278750] [2019-12-18 23:24:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:32,149 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 23:24:32,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367278750] [2019-12-18 23:24:32,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:24:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668833604] [2019-12-18 23:24:32,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:24:32,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:24:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:24:32,151 INFO L87 Difference]: Start difference. First operand 4032 states and 12853 transitions. Second operand 16 states. [2019-12-18 23:24:32,899 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-18 23:24:33,277 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-12-18 23:24:33,561 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-18 23:24:33,845 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-18 23:24:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:35,321 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-18 23:24:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:24:35,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:24:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:35,334 INFO L225 Difference]: With dead ends: 6137 [2019-12-18 23:24:35,334 INFO L226 Difference]: Without dead ends: 6137 [2019-12-18 23:24:35,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-18 23:24:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-18 23:24:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-18 23:24:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-18 23:24:35,452 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-18 23:24:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:35,452 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-18 23:24:35,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:24:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-18 23:24:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:35,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:35,461 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 23:24:35,461 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 23:24:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash 536686401, now seen corresponding path program 2 times [2019-12-18 23:24:35,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:35,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508471048] [2019-12-18 23:24:35,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:36,280 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 23:24:36,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508471048] [2019-12-18 23:24:36,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:36,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:24:36,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547105125] [2019-12-18 23:24:36,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:24:36,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:24:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:24:36,283 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 16 states. [2019-12-18 23:24:36,546 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-12-18 23:24:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:39,367 INFO L93 Difference]: Finished difference Result 6649 states and 21281 transitions. [2019-12-18 23:24:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:24:39,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:24:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:39,377 INFO L225 Difference]: With dead ends: 6649 [2019-12-18 23:24:39,377 INFO L226 Difference]: Without dead ends: 6649 [2019-12-18 23:24:39,378 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 23:24:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6649 states. [2019-12-18 23:24:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6649 to 4554. [2019-12-18 23:24:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2019-12-18 23:24:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 14459 transitions. [2019-12-18 23:24:39,491 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 14459 transitions. Word has length 27 [2019-12-18 23:24:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:39,491 INFO L462 AbstractCegarLoop]: Abstraction has 4554 states and 14459 transitions. [2019-12-18 23:24:39,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:24:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 14459 transitions. [2019-12-18 23:24:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:39,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:39,500 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 23:24:39,501 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 23:24:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash -430321155, now seen corresponding path program 3 times [2019-12-18 23:24:39,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:39,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623305850] [2019-12-18 23:24:39,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:40,119 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-18 23:24:40,207 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 23:24:40,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623305850] [2019-12-18 23:24:40,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:40,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:40,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198630389] [2019-12-18 23:24:40,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:40,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:40,209 INFO L87 Difference]: Start difference. First operand 4554 states and 14459 transitions. Second operand 15 states. [2019-12-18 23:24:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:43,185 INFO L93 Difference]: Finished difference Result 6369 states and 20451 transitions. [2019-12-18 23:24:43,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:43,186 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:24:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:43,195 INFO L225 Difference]: With dead ends: 6369 [2019-12-18 23:24:43,196 INFO L226 Difference]: Without dead ends: 6369 [2019-12-18 23:24:43,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:24:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2019-12-18 23:24:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 4554. [2019-12-18 23:24:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2019-12-18 23:24:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 14459 transitions. [2019-12-18 23:24:43,323 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 14459 transitions. Word has length 27 [2019-12-18 23:24:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:43,323 INFO L462 AbstractCegarLoop]: Abstraction has 4554 states and 14459 transitions. [2019-12-18 23:24:43,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 14459 transitions. [2019-12-18 23:24:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:43,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:43,334 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 23:24:43,334 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 23:24:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1215770469, now seen corresponding path program 4 times [2019-12-18 23:24:43,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:43,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953063592] [2019-12-18 23:24:43,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:43,861 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-12-18 23:24:44,168 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 23:24:44,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953063592] [2019-12-18 23:24:44,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:44,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:44,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947775986] [2019-12-18 23:24:44,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:44,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:44,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:44,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:44,171 INFO L87 Difference]: Start difference. First operand 4554 states and 14459 transitions. Second operand 15 states. [2019-12-18 23:24:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:47,493 INFO L93 Difference]: Finished difference Result 8387 states and 27219 transitions. [2019-12-18 23:24:47,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:24:47,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:24:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:47,506 INFO L225 Difference]: With dead ends: 8387 [2019-12-18 23:24:47,506 INFO L226 Difference]: Without dead ends: 8387 [2019-12-18 23:24:47,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8387 states. [2019-12-18 23:24:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8387 to 5289. [2019-12-18 23:24:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5289 states. [2019-12-18 23:24:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 16942 transitions. [2019-12-18 23:24:47,644 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 16942 transitions. Word has length 27 [2019-12-18 23:24:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:47,645 INFO L462 AbstractCegarLoop]: Abstraction has 5289 states and 16942 transitions. [2019-12-18 23:24:47,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 16942 transitions. [2019-12-18 23:24:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:47,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:47,655 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 23:24:47,655 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 23:24:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1215770468, now seen corresponding path program 1 times [2019-12-18 23:24:47,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:47,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017970281] [2019-12-18 23:24:47,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:48,077 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2019-12-18 23:24:48,450 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 23:24:48,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017970281] [2019-12-18 23:24:48,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:48,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:48,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353150390] [2019-12-18 23:24:48,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:48,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:48,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:48,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:48,452 INFO L87 Difference]: Start difference. First operand 5289 states and 16942 transitions. Second operand 15 states. [2019-12-18 23:24:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:51,797 INFO L93 Difference]: Finished difference Result 8312 states and 26935 transitions. [2019-12-18 23:24:51,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:24:51,797 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:24:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:51,810 INFO L225 Difference]: With dead ends: 8312 [2019-12-18 23:24:51,810 INFO L226 Difference]: Without dead ends: 8312 [2019-12-18 23:24:51,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8312 states. [2019-12-18 23:24:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8312 to 4599. [2019-12-18 23:24:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-18 23:24:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 14604 transitions. [2019-12-18 23:24:51,929 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 14604 transitions. Word has length 27 [2019-12-18 23:24:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:51,929 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 14604 transitions. [2019-12-18 23:24:51,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 14604 transitions. [2019-12-18 23:24:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:51,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:51,936 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 23:24:51,936 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 23:24:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash 111879065, now seen corresponding path program 5 times [2019-12-18 23:24:51,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:51,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128576594] [2019-12-18 23:24:51,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:52,364 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-12-18 23:24:52,517 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-12-18 23:24:52,712 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 23:24:52,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128576594] [2019-12-18 23:24:52,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:52,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:52,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83920286] [2019-12-18 23:24:52,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:52,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:52,714 INFO L87 Difference]: Start difference. First operand 4599 states and 14604 transitions. Second operand 15 states. [2019-12-18 23:24:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:55,778 INFO L93 Difference]: Finished difference Result 6414 states and 20586 transitions. [2019-12-18 23:24:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:55,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:24:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:55,787 INFO L225 Difference]: With dead ends: 6414 [2019-12-18 23:24:55,787 INFO L226 Difference]: Without dead ends: 6414 [2019-12-18 23:24:55,788 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 23:24:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2019-12-18 23:24:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 4599. [2019-12-18 23:24:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-18 23:24:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 14604 transitions. [2019-12-18 23:24:55,877 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 14604 transitions. Word has length 27 [2019-12-18 23:24:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:55,878 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 14604 transitions. [2019-12-18 23:24:55,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 14604 transitions. [2019-12-18 23:24:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:55,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:55,884 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 23:24:55,884 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 23:24:55,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 749167323, now seen corresponding path program 6 times [2019-12-18 23:24:55,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:55,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157819321] [2019-12-18 23:24:55,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:56,587 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 23:24:56,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157819321] [2019-12-18 23:24:56,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:56,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:56,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744290059] [2019-12-18 23:24:56,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:56,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:56,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:56,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:56,589 INFO L87 Difference]: Start difference. First operand 4599 states and 14604 transitions. Second operand 15 states. [2019-12-18 23:24:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:59,161 INFO L93 Difference]: Finished difference Result 6484 states and 20896 transitions. [2019-12-18 23:24:59,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:24:59,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:24:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:59,173 INFO L225 Difference]: With dead ends: 6484 [2019-12-18 23:24:59,173 INFO L226 Difference]: Without dead ends: 6484 [2019-12-18 23:24:59,173 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 23:24:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-12-18 23:24:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 5289. [2019-12-18 23:24:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5289 states. [2019-12-18 23:24:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 16942 transitions. [2019-12-18 23:24:59,292 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 16942 transitions. Word has length 27 [2019-12-18 23:24:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:59,292 INFO L462 AbstractCegarLoop]: Abstraction has 5289 states and 16942 transitions. [2019-12-18 23:24:59,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 16942 transitions. [2019-12-18 23:24:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:24:59,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:59,302 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 23:24:59,302 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 23:24:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:59,302 INFO L82 PathProgramCache]: Analyzing trace with hash 749167324, now seen corresponding path program 2 times [2019-12-18 23:24:59,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:59,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862267815] [2019-12-18 23:24:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:59,951 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 23:24:59,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862267815] [2019-12-18 23:24:59,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:59,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:59,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524431368] [2019-12-18 23:24:59,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:59,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:59,953 INFO L87 Difference]: Start difference. First operand 5289 states and 16942 transitions. Second operand 15 states. [2019-12-18 23:25:00,788 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-12-18 23:25:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:02,879 INFO L93 Difference]: Finished difference Result 6484 states and 20776 transitions. [2019-12-18 23:25:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:25:02,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-18 23:25:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:02,888 INFO L225 Difference]: With dead ends: 6484 [2019-12-18 23:25:02,889 INFO L226 Difference]: Without dead ends: 6484 [2019-12-18 23:25:02,889 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 23:25:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-12-18 23:25:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 4109. [2019-12-18 23:25:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-12-18 23:25:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 13114 transitions. [2019-12-18 23:25:02,954 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 13114 transitions. Word has length 27 [2019-12-18 23:25:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:02,954 INFO L462 AbstractCegarLoop]: Abstraction has 4109 states and 13114 transitions. [2019-12-18 23:25:02,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:25:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 13114 transitions. [2019-12-18 23:25:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:02,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:02,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:02,959 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 23:25:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1133772382, now seen corresponding path program 2 times [2019-12-18 23:25:02,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:02,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745245230] [2019-12-18 23:25:02,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:03,435 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2019-12-18 23:25:03,651 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 23:25:03,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745245230] [2019-12-18 23:25:03,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:03,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:03,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958628888] [2019-12-18 23:25:03,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:03,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:03,653 INFO L87 Difference]: Start difference. First operand 4109 states and 13114 transitions. Second operand 16 states. [2019-12-18 23:25:04,372 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-12-18 23:25:05,010 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 23:25:05,329 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-18 23:25:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:06,909 INFO L93 Difference]: Finished difference Result 6154 states and 19786 transitions. [2019-12-18 23:25:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:06,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:06,919 INFO L225 Difference]: With dead ends: 6154 [2019-12-18 23:25:06,920 INFO L226 Difference]: Without dead ends: 6154 [2019-12-18 23:25:06,920 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 23:25:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2019-12-18 23:25:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 4049. [2019-12-18 23:25:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-18 23:25:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12934 transitions. [2019-12-18 23:25:06,989 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12934 transitions. Word has length 27 [2019-12-18 23:25:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:06,989 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12934 transitions. [2019-12-18 23:25:06,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12934 transitions. [2019-12-18 23:25:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:06,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:06,994 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 23:25:06,994 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 23:25:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 148247614, now seen corresponding path program 3 times [2019-12-18 23:25:06,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:06,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896183766] [2019-12-18 23:25:06,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:07,430 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2019-12-18 23:25:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:07,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896183766] [2019-12-18 23:25:07,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:07,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:07,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181774564] [2019-12-18 23:25:07,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:07,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:07,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:07,750 INFO L87 Difference]: Start difference. First operand 4049 states and 12934 transitions. Second operand 16 states. [2019-12-18 23:25:09,151 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-18 23:25:09,451 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-18 23:25:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:11,027 INFO L93 Difference]: Finished difference Result 5968 states and 19228 transitions. [2019-12-18 23:25:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:11,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:11,037 INFO L225 Difference]: With dead ends: 5968 [2019-12-18 23:25:11,038 INFO L226 Difference]: Without dead ends: 5968 [2019-12-18 23:25:11,038 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 23:25:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2019-12-18 23:25:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3923. [2019-12-18 23:25:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-18 23:25:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12556 transitions. [2019-12-18 23:25:11,098 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12556 transitions. Word has length 27 [2019-12-18 23:25:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:11,098 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 12556 transitions. [2019-12-18 23:25:11,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12556 transitions. [2019-12-18 23:25:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:11,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:11,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:11,103 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 23:25:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -59649168, now seen corresponding path program 4 times [2019-12-18 23:25:11,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:11,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036670293] [2019-12-18 23:25:11,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:12,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 23:25:12,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036670293] [2019-12-18 23:25:12,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:12,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:12,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148059628] [2019-12-18 23:25:12,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:12,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:12,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:12,079 INFO L87 Difference]: Start difference. First operand 3923 states and 12556 transitions. Second operand 16 states. [2019-12-18 23:25:13,080 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 23:25:13,351 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-12-18 23:25:13,631 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-18 23:25:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:15,349 INFO L93 Difference]: Finished difference Result 5873 states and 19012 transitions. [2019-12-18 23:25:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:15,350 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:15,363 INFO L225 Difference]: With dead ends: 5873 [2019-12-18 23:25:15,364 INFO L226 Difference]: Without dead ends: 5873 [2019-12-18 23:25:15,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:25:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5873 states. [2019-12-18 23:25:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5873 to 4813. [2019-12-18 23:25:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2019-12-18 23:25:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 15514 transitions. [2019-12-18 23:25:15,467 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 15514 transitions. Word has length 27 [2019-12-18 23:25:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:15,467 INFO L462 AbstractCegarLoop]: Abstraction has 4813 states and 15514 transitions. [2019-12-18 23:25:15,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 15514 transitions. [2019-12-18 23:25:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:15,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:15,473 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 23:25:15,473 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 23:25:15,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:15,473 INFO L82 PathProgramCache]: Analyzing trace with hash -59649167, now seen corresponding path program 1 times [2019-12-18 23:25:15,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:15,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684550530] [2019-12-18 23:25:15,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:16,221 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 23:25:16,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684550530] [2019-12-18 23:25:16,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:16,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:16,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914227507] [2019-12-18 23:25:16,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:16,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:16,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:16,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:16,223 INFO L87 Difference]: Start difference. First operand 4813 states and 15514 transitions. Second operand 16 states. [2019-12-18 23:25:17,824 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 23:25:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:19,612 INFO L93 Difference]: Finished difference Result 5798 states and 18728 transitions. [2019-12-18 23:25:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:19,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:19,622 INFO L225 Difference]: With dead ends: 5798 [2019-12-18 23:25:19,622 INFO L226 Difference]: Without dead ends: 5798 [2019-12-18 23:25:19,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:25:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5798 states. [2019-12-18 23:25:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5798 to 3923. [2019-12-18 23:25:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-18 23:25:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12556 transitions. [2019-12-18 23:25:19,727 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12556 transitions. Word has length 27 [2019-12-18 23:25:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:19,727 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 12556 transitions. [2019-12-18 23:25:19,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12556 transitions. [2019-12-18 23:25:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:19,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:19,731 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 23:25:19,731 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 23:25:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1875030286, now seen corresponding path program 5 times [2019-12-18 23:25:19,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:19,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841034344] [2019-12-18 23:25:19,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:20,380 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 23:25:20,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841034344] [2019-12-18 23:25:20,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:20,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:20,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989610448] [2019-12-18 23:25:20,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:20,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:20,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:20,384 INFO L87 Difference]: Start difference. First operand 3923 states and 12556 transitions. Second operand 16 states. [2019-12-18 23:25:20,947 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-12-18 23:25:21,712 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-18 23:25:22,092 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 23:25:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:23,981 INFO L93 Difference]: Finished difference Result 5738 states and 18668 transitions. [2019-12-18 23:25:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:25:23,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:23,990 INFO L225 Difference]: With dead ends: 5738 [2019-12-18 23:25:23,990 INFO L226 Difference]: Without dead ends: 5738 [2019-12-18 23:25:23,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:25:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2019-12-18 23:25:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 4753. [2019-12-18 23:25:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4753 states. [2019-12-18 23:25:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 15334 transitions. [2019-12-18 23:25:24,053 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 15334 transitions. Word has length 27 [2019-12-18 23:25:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:24,054 INFO L462 AbstractCegarLoop]: Abstraction has 4753 states and 15334 transitions. [2019-12-18 23:25:24,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 15334 transitions. [2019-12-18 23:25:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:24,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:24,060 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 23:25:24,060 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 23:25:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1875030287, now seen corresponding path program 2 times [2019-12-18 23:25:24,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:24,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872155984] [2019-12-18 23:25:24,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:24,544 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-12-18 23:25:24,867 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 23:25:24,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872155984] [2019-12-18 23:25:24,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:24,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:24,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185179085] [2019-12-18 23:25:24,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:24,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:24,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:24,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:24,869 INFO L87 Difference]: Start difference. First operand 4753 states and 15334 transitions. Second operand 16 states. [2019-12-18 23:25:25,885 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 23:25:26,157 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 23:25:26,525 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-12-18 23:25:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:28,336 INFO L93 Difference]: Finished difference Result 5738 states and 18548 transitions. [2019-12-18 23:25:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:25:28,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:28,348 INFO L225 Difference]: With dead ends: 5738 [2019-12-18 23:25:28,348 INFO L226 Difference]: Without dead ends: 5738 [2019-12-18 23:25:28,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:25:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2019-12-18 23:25:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 3923. [2019-12-18 23:25:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-18 23:25:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12556 transitions. [2019-12-18 23:25:28,414 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12556 transitions. Word has length 27 [2019-12-18 23:25:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:28,414 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 12556 transitions. [2019-12-18 23:25:28,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12556 transitions. [2019-12-18 23:25:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:28,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:28,417 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 23:25:28,417 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 23:25:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1352221194, now seen corresponding path program 6 times [2019-12-18 23:25:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:28,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935796779] [2019-12-18 23:25:28,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:28,868 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-12-18 23:25:29,152 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 23:25:29,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935796779] [2019-12-18 23:25:29,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:29,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:29,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160915743] [2019-12-18 23:25:29,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:29,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:29,154 INFO L87 Difference]: Start difference. First operand 3923 states and 12556 transitions. Second operand 16 states. [2019-12-18 23:25:30,456 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:25:30,859 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-18 23:25:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:33,047 INFO L93 Difference]: Finished difference Result 7681 states and 25032 transitions. [2019-12-18 23:25:33,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:25:33,047 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:33,059 INFO L225 Difference]: With dead ends: 7681 [2019-12-18 23:25:33,059 INFO L226 Difference]: Without dead ends: 7681 [2019-12-18 23:25:33,059 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 23:25:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7681 states. [2019-12-18 23:25:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7681 to 3929. [2019-12-18 23:25:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-12-18 23:25:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 12575 transitions. [2019-12-18 23:25:33,128 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 12575 transitions. Word has length 27 [2019-12-18 23:25:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:33,128 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 12575 transitions. [2019-12-18 23:25:33,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 12575 transitions. [2019-12-18 23:25:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:33,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:33,131 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 23:25:33,132 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 23:25:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash 309537078, now seen corresponding path program 7 times [2019-12-18 23:25:33,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:33,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452395903] [2019-12-18 23:25:33,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:33,869 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 23:25:33,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452395903] [2019-12-18 23:25:33,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:33,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:33,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030940057] [2019-12-18 23:25:33,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:33,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:33,871 INFO L87 Difference]: Start difference. First operand 3929 states and 12575 transitions. Second operand 16 states. [2019-12-18 23:25:35,122 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2019-12-18 23:25:35,434 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 23:25:35,748 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-18 23:25:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:37,470 INFO L93 Difference]: Finished difference Result 5669 states and 18371 transitions. [2019-12-18 23:25:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:37,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:37,480 INFO L225 Difference]: With dead ends: 5669 [2019-12-18 23:25:37,480 INFO L226 Difference]: Without dead ends: 5669 [2019-12-18 23:25:37,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-12-18 23:25:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-12-18 23:25:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4619. [2019-12-18 23:25:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4619 states. [2019-12-18 23:25:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4619 states to 4619 states and 14913 transitions. [2019-12-18 23:25:37,556 INFO L78 Accepts]: Start accepts. Automaton has 4619 states and 14913 transitions. Word has length 27 [2019-12-18 23:25:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:37,556 INFO L462 AbstractCegarLoop]: Abstraction has 4619 states and 14913 transitions. [2019-12-18 23:25:37,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 14913 transitions. [2019-12-18 23:25:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:25:37,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:37,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:37,560 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 23:25:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 309537079, now seen corresponding path program 3 times [2019-12-18 23:25:37,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:37,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284498516] [2019-12-18 23:25:37,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:38,265 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 23:25:38,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284498516] [2019-12-18 23:25:38,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:38,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:25:38,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233227137] [2019-12-18 23:25:38,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:25:38,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:25:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:25:38,267 INFO L87 Difference]: Start difference. First operand 4619 states and 14913 transitions. Second operand 16 states. [2019-12-18 23:25:40,017 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 23:25:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:41,754 INFO L93 Difference]: Finished difference Result 5594 states and 18087 transitions. [2019-12-18 23:25:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:25:41,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-18 23:25:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:41,766 INFO L225 Difference]: With dead ends: 5594 [2019-12-18 23:25:41,766 INFO L226 Difference]: Without dead ends: 5594 [2019-12-18 23:25:41,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2019-12-18 23:25:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2019-12-18 23:25:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 3549. [2019-12-18 23:25:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-18 23:25:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-18 23:25:41,828 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-18 23:25:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:41,828 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-18 23:25:41,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:25:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-18 23:25:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:25:41,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:41,832 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 23:25:41,832 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 23:25:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:41,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2105467465, now seen corresponding path program 1 times [2019-12-18 23:25:41,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:41,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123845840] [2019-12-18 23:25:41,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:42,593 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 23:25:42,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123845840] [2019-12-18 23:25:42,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:42,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 23:25:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647241426] [2019-12-18 23:25:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:25:42,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:25:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:25:42,595 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 18 states. [2019-12-18 23:25:42,784 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-12-18 23:25:43,011 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-18 23:25:43,206 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-18 23:25:43,435 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-18 23:25:43,790 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-12-18 23:25:44,019 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-18 23:25:44,343 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-12-18 23:25:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:46,040 INFO L93 Difference]: Finished difference Result 7360 states and 24067 transitions. [2019-12-18 23:25:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:46,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-18 23:25:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:46,054 INFO L225 Difference]: With dead ends: 7360 [2019-12-18 23:25:46,054 INFO L226 Difference]: Without dead ends: 7360 [2019-12-18 23:25:46,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2019-12-18 23:25:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-12-18 23:25:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 4754. [2019-12-18 23:25:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4754 states. [2019-12-18 23:25:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 15310 transitions. [2019-12-18 23:25:46,143 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 15310 transitions. Word has length 30 [2019-12-18 23:25:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:46,144 INFO L462 AbstractCegarLoop]: Abstraction has 4754 states and 15310 transitions. [2019-12-18 23:25:46,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:25:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 15310 transitions. [2019-12-18 23:25:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:25:46,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:46,148 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 23:25:46,148 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 23:25:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash 776627592, now seen corresponding path program 1 times [2019-12-18 23:25:46,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:46,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550225473] [2019-12-18 23:25:46,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:47,036 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 23:25:47,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550225473] [2019-12-18 23:25:47,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:47,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 23:25:47,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703825222] [2019-12-18 23:25:47,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:25:47,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:25:47,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:25:47,037 INFO L87 Difference]: Start difference. First operand 4754 states and 15310 transitions. Second operand 19 states. [2019-12-18 23:25:47,414 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-18 23:25:47,631 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-18 23:25:47,899 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-12-18 23:25:48,185 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-12-18 23:25:48,693 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2019-12-18 23:25:49,317 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 75 [2019-12-18 23:25:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:51,795 INFO L93 Difference]: Finished difference Result 8625 states and 28142 transitions. [2019-12-18 23:25:51,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:51,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-18 23:25:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:51,811 INFO L225 Difference]: With dead ends: 8625 [2019-12-18 23:25:51,811 INFO L226 Difference]: Without dead ends: 8625 [2019-12-18 23:25:51,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-12-18 23:25:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2019-12-18 23:25:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 5356. [2019-12-18 23:25:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5356 states. [2019-12-18 23:25:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 17165 transitions. [2019-12-18 23:25:51,900 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 17165 transitions. Word has length 30 [2019-12-18 23:25:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:51,900 INFO L462 AbstractCegarLoop]: Abstraction has 5356 states and 17165 transitions. [2019-12-18 23:25:51,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:25:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 17165 transitions. [2019-12-18 23:25:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:25:51,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:51,906 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 23:25:51,906 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 23:25:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1738624317, now seen corresponding path program 2 times [2019-12-18 23:25:51,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:51,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501179637] [2019-12-18 23:25:51,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:52,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 23:25:52,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501179637] [2019-12-18 23:25:52,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:52,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:25:52,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58905282] [2019-12-18 23:25:52,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:25:52,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:52,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:25:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:25:52,133 INFO L87 Difference]: Start difference. First operand 5356 states and 17165 transitions. Second operand 12 states. [2019-12-18 23:25:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:54,609 INFO L93 Difference]: Finished difference Result 12092 states and 38988 transitions. [2019-12-18 23:25:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:25:54,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-18 23:25:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:54,626 INFO L225 Difference]: With dead ends: 12092 [2019-12-18 23:25:54,626 INFO L226 Difference]: Without dead ends: 12092 [2019-12-18 23:25:54,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-12-18 23:25:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12092 states. [2019-12-18 23:25:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12092 to 8256. [2019-12-18 23:25:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8256 states. [2019-12-18 23:25:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 27189 transitions. [2019-12-18 23:25:54,744 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 27189 transitions. Word has length 30 [2019-12-18 23:25:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:54,744 INFO L462 AbstractCegarLoop]: Abstraction has 8256 states and 27189 transitions. [2019-12-18 23:25:54,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:25:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 27189 transitions. [2019-12-18 23:25:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:25:54,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:54,751 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 23:25:54,752 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 23:25:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1793695977, now seen corresponding path program 3 times [2019-12-18 23:25:54,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:54,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170641465] [2019-12-18 23:25:54,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:54,977 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 23:25:54,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170641465] [2019-12-18 23:25:54,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:54,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:25:54,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078150167] [2019-12-18 23:25:54,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:25:54,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:54,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:25:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:25:54,980 INFO L87 Difference]: Start difference. First operand 8256 states and 27189 transitions. Second operand 12 states. [2019-12-18 23:25:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:57,246 INFO L93 Difference]: Finished difference Result 17638 states and 58336 transitions. [2019-12-18 23:25:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:25:57,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-12-18 23:25:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:57,273 INFO L225 Difference]: With dead ends: 17638 [2019-12-18 23:25:57,274 INFO L226 Difference]: Without dead ends: 17638 [2019-12-18 23:25:57,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:25:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-18 23:25:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 7810. [2019-12-18 23:25:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7810 states. [2019-12-18 23:25:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 25817 transitions. [2019-12-18 23:25:57,432 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 25817 transitions. Word has length 30 [2019-12-18 23:25:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:57,432 INFO L462 AbstractCegarLoop]: Abstraction has 7810 states and 25817 transitions. [2019-12-18 23:25:57,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:25:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 25817 transitions. [2019-12-18 23:25:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:25:57,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:57,439 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 23:25:57,439 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 23:25:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash 590262918, now seen corresponding path program 2 times [2019-12-18 23:25:57,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:57,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26012698] [2019-12-18 23:25:57,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:58,584 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 23:25:58,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26012698] [2019-12-18 23:25:58,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:25:58,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:25:58,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181838738] [2019-12-18 23:25:58,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 23:25:58,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 23:25:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:25:58,586 INFO L87 Difference]: Start difference. First operand 7810 states and 25817 transitions. Second operand 20 states. [2019-12-18 23:25:59,295 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-12-18 23:25:59,571 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-12-18 23:25:59,877 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-12-18 23:26:00,413 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2019-12-18 23:26:00,793 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-18 23:26:01,114 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 23:26:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:03,320 INFO L93 Difference]: Finished difference Result 12549 states and 41473 transitions. [2019-12-18 23:26:03,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 23:26:03,321 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-18 23:26:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:03,340 INFO L225 Difference]: With dead ends: 12549 [2019-12-18 23:26:03,340 INFO L226 Difference]: Without dead ends: 12549 [2019-12-18 23:26:03,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 23:26:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12549 states. [2019-12-18 23:26:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12549 to 8000. [2019-12-18 23:26:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2019-12-18 23:26:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 26387 transitions. [2019-12-18 23:26:03,477 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 26387 transitions. Word has length 30 [2019-12-18 23:26:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:03,478 INFO L462 AbstractCegarLoop]: Abstraction has 8000 states and 26387 transitions. [2019-12-18 23:26:03,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 23:26:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 26387 transitions. [2019-12-18 23:26:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:26:03,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:03,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:03,486 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 23:26:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1218334886, now seen corresponding path program 3 times [2019-12-18 23:26:03,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:03,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196216964] [2019-12-18 23:26:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:05,062 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 23:26:05,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196216964] [2019-12-18 23:26:05,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:05,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:26:05,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283760516] [2019-12-18 23:26:05,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 23:26:05,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 23:26:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:26:05,064 INFO L87 Difference]: Start difference. First operand 8000 states and 26387 transitions. Second operand 20 states. [2019-12-18 23:26:05,752 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-12-18 23:26:05,930 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-18 23:26:06,258 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 23:26:06,597 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-12-18 23:26:07,202 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 69 [2019-12-18 23:26:07,635 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-18 23:26:08,009 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-18 23:26:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:10,796 INFO L93 Difference]: Finished difference Result 12629 states and 41713 transitions. [2019-12-18 23:26:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 23:26:10,796 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-18 23:26:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:10,815 INFO L225 Difference]: With dead ends: 12629 [2019-12-18 23:26:10,815 INFO L226 Difference]: Without dead ends: 12629 [2019-12-18 23:26:10,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 23:26:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12629 states. [2019-12-18 23:26:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12629 to 7890. [2019-12-18 23:26:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7890 states. [2019-12-18 23:26:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7890 states to 7890 states and 26057 transitions. [2019-12-18 23:26:10,937 INFO L78 Accepts]: Start accepts. Automaton has 7890 states and 26057 transitions. Word has length 30 [2019-12-18 23:26:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:10,938 INFO L462 AbstractCegarLoop]: Abstraction has 7890 states and 26057 transitions. [2019-12-18 23:26:10,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 23:26:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7890 states and 26057 transitions. [2019-12-18 23:26:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:26:10,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:10,944 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 23:26:10,944 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 23:26:10,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1108143156, now seen corresponding path program 4 times [2019-12-18 23:26:10,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:10,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232912109] [2019-12-18 23:26:10,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:11,815 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 23:26:11,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232912109] [2019-12-18 23:26:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:26:11,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853293305] [2019-12-18 23:26:11,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 23:26:11,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 23:26:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:26:11,816 INFO L87 Difference]: Start difference. First operand 7890 states and 26057 transitions. Second operand 20 states. [2019-12-18 23:26:12,768 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-18 23:26:13,107 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-18 23:26:13,331 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-18 23:26:13,705 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-18 23:26:14,032 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-18 23:26:14,451 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-18 23:26:14,871 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2019-12-18 23:26:15,194 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-12-18 23:26:15,531 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2019-12-18 23:26:15,921 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-12-18 23:26:16,305 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-18 23:26:16,703 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-12-18 23:26:17,948 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-18 23:26:18,406 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-18 23:26:18,802 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-12-18 23:26:19,722 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-18 23:26:20,165 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-18 23:26:20,376 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-18 23:26:20,776 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-18 23:26:21,330 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-18 23:26:21,573 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-18 23:26:21,855 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-12-18 23:26:22,269 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-18 23:26:22,580 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-18 23:26:23,047 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-18 23:26:23,463 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-12-18 23:26:23,887 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-18 23:26:24,209 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-18 23:26:24,446 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2019-12-18 23:26:24,886 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-12-18 23:26:25,223 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-12-18 23:26:25,982 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-12-18 23:26:26,225 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-18 23:26:26,616 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-12-18 23:26:26,918 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-12-18 23:26:27,325 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-18 23:26:27,673 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-18 23:26:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:28,054 INFO L93 Difference]: Finished difference Result 18755 states and 62716 transitions. [2019-12-18 23:26:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 23:26:28,055 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-18 23:26:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:28,084 INFO L225 Difference]: With dead ends: 18755 [2019-12-18 23:26:28,084 INFO L226 Difference]: Without dead ends: 18755 [2019-12-18 23:26:28,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1209, Invalid=3621, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 23:26:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18755 states. [2019-12-18 23:26:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18755 to 9918. [2019-12-18 23:26:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9918 states. [2019-12-18 23:26:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9918 states to 9918 states and 33287 transitions. [2019-12-18 23:26:28,264 INFO L78 Accepts]: Start accepts. Automaton has 9918 states and 33287 transitions. Word has length 30 [2019-12-18 23:26:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:28,264 INFO L462 AbstractCegarLoop]: Abstraction has 9918 states and 33287 transitions. [2019-12-18 23:26:28,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 23:26:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9918 states and 33287 transitions. [2019-12-18 23:26:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:26:28,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:28,273 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 23:26:28,273 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 23:26:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash 124352686, now seen corresponding path program 5 times [2019-12-18 23:26:28,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:28,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13007923] [2019-12-18 23:26:28,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:29,029 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 23:26:29,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13007923] [2019-12-18 23:26:29,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:29,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:26:29,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056395133] [2019-12-18 23:26:29,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 23:26:29,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 23:26:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:26:29,031 INFO L87 Difference]: Start difference. First operand 9918 states and 33287 transitions. Second operand 20 states. [2019-12-18 23:26:30,011 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-18 23:26:30,313 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-18 23:26:30,542 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-18 23:26:30,907 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-18 23:26:31,221 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-18 23:26:31,595 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-12-18 23:26:31,821 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-18 23:26:32,153 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-12-18 23:26:32,463 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-18 23:26:32,682 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-12-18 23:26:32,895 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-18 23:26:33,455 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-12-18 23:26:35,363 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-18 23:26:35,690 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-18 23:26:35,912 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-12-18 23:26:36,194 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-18 23:26:36,603 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-18 23:26:36,842 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-18 23:26:37,207 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-18 23:26:37,616 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-18 23:26:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:38,846 INFO L93 Difference]: Finished difference Result 15447 states and 51817 transitions. [2019-12-18 23:26:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 23:26:38,847 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-18 23:26:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:38,874 INFO L225 Difference]: With dead ends: 15447 [2019-12-18 23:26:38,874 INFO L226 Difference]: Without dead ends: 15447 [2019-12-18 23:26:38,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=713, Invalid=2043, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 23:26:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-12-18 23:26:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 10782. [2019-12-18 23:26:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10782 states. [2019-12-18 23:26:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10782 states to 10782 states and 36202 transitions. [2019-12-18 23:26:39,034 INFO L78 Accepts]: Start accepts. Automaton has 10782 states and 36202 transitions. Word has length 30 [2019-12-18 23:26:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:39,035 INFO L462 AbstractCegarLoop]: Abstraction has 10782 states and 36202 transitions. [2019-12-18 23:26:39,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 23:26:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10782 states and 36202 transitions. [2019-12-18 23:26:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:26:39,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:39,049 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 23:26:39,049 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 23:26:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1083255696, now seen corresponding path program 6 times [2019-12-18 23:26:39,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:39,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387988910] [2019-12-18 23:26:39,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:39,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387988910] [2019-12-18 23:26:39,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:39,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:26:39,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998834900] [2019-12-18 23:26:39,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:26:39,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:26:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:26:39,312 INFO L87 Difference]: Start difference. First operand 10782 states and 36202 transitions. Second operand 13 states. [2019-12-18 23:26:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:42,622 INFO L93 Difference]: Finished difference Result 18501 states and 61385 transitions. [2019-12-18 23:26:42,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 23:26:42,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-18 23:26:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:42,652 INFO L225 Difference]: With dead ends: 18501 [2019-12-18 23:26:42,652 INFO L226 Difference]: Without dead ends: 18501 [2019-12-18 23:26:42,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2019-12-18 23:26:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18501 states. [2019-12-18 23:26:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18501 to 9524. [2019-12-18 23:26:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9524 states. [2019-12-18 23:26:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 32100 transitions. [2019-12-18 23:26:42,829 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 32100 transitions. Word has length 30 [2019-12-18 23:26:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:42,830 INFO L462 AbstractCegarLoop]: Abstraction has 9524 states and 32100 transitions. [2019-12-18 23:26:42,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:26:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 32100 transitions. [2019-12-18 23:26:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:26:42,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:42,838 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 23:26:42,839 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 23:26:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 494321211, now seen corresponding path program 1 times [2019-12-18 23:26:42,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:42,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948395861] [2019-12-18 23:26:42,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:43,539 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-12-18 23:26:43,925 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 23:26:43,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948395861] [2019-12-18 23:26:43,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:43,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 23:26:43,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431449740] [2019-12-18 23:26:43,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 23:26:43,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:43,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 23:26:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:26:43,927 INFO L87 Difference]: Start difference. First operand 9524 states and 32100 transitions. Second operand 20 states. [2019-12-18 23:26:45,021 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-18 23:26:45,186 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-12-18 23:26:45,562 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-18 23:26:45,766 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-18 23:26:45,922 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-18 23:26:46,287 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-18 23:26:46,481 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-18 23:26:46,968 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-12-18 23:26:47,151 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-18 23:26:47,354 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-18 23:26:47,884 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-18 23:26:48,117 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-18 23:26:48,615 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-18 23:26:48,845 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-18 23:26:49,181 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-12-18 23:26:49,985 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-12-18 23:26:50,254 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-18 23:26:50,411 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-18 23:26:50,591 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-12-18 23:26:50,922 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-18 23:26:51,106 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-12-18 23:26:51,321 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-12-18 23:26:51,523 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-18 23:26:51,802 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 23:26:52,062 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-12-18 23:26:52,294 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-12-18 23:26:52,651 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-18 23:26:52,927 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2019-12-18 23:26:53,144 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 23:26:53,388 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-12-18 23:26:53,678 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-12-18 23:26:53,939 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-18 23:26:54,256 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2019-12-18 23:26:54,585 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-12-18 23:26:54,937 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-12-18 23:26:55,283 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-12-18 23:26:55,768 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2019-12-18 23:26:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:55,998 INFO L93 Difference]: Finished difference Result 10234 states and 34230 transitions. [2019-12-18 23:26:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 23:26:55,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-18 23:26:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:56,016 INFO L225 Difference]: With dead ends: 10234 [2019-12-18 23:26:56,016 INFO L226 Difference]: Without dead ends: 10234 [2019-12-18 23:26:56,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1312, Invalid=3518, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 23:26:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10234 states. [2019-12-18 23:26:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10234 to 10134. [2019-12-18 23:26:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10134 states. [2019-12-18 23:26:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10134 states to 10134 states and 33950 transitions. [2019-12-18 23:26:56,157 INFO L78 Accepts]: Start accepts. Automaton has 10134 states and 33950 transitions. Word has length 31 [2019-12-18 23:26:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:56,158 INFO L462 AbstractCegarLoop]: Abstraction has 10134 states and 33950 transitions. [2019-12-18 23:26:56,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 23:26:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10134 states and 33950 transitions. [2019-12-18 23:26:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:26:56,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:56,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:56,167 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 23:26:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1182482853, now seen corresponding path program 2 times [2019-12-18 23:26:56,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:56,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562123082] [2019-12-18 23:26:56,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:57,031 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 23:26:57,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562123082] [2019-12-18 23:26:57,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:26:57,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 23:26:57,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142385009] [2019-12-18 23:26:57,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:26:57,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:26:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:26:57,032 INFO L87 Difference]: Start difference. First operand 10134 states and 33950 transitions. Second operand 18 states. [2019-12-18 23:26:58,201 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-12-18 23:26:58,567 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-12-18 23:26:58,754 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 23:26:58,901 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-12-18 23:26:59,222 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-18 23:26:59,359 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-18 23:26:59,533 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-18 23:26:59,975 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-18 23:27:00,160 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-18 23:27:00,436 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-18 23:27:00,913 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-12-18 23:27:01,130 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-12-18 23:27:01,569 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-12-18 23:27:01,793 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-12-18 23:27:02,803 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-12-18 23:27:03,056 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 23:27:03,204 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 23:27:03,376 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-12-18 23:27:03,660 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-12-18 23:27:03,835 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-18 23:27:04,033 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 23:27:04,220 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-18 23:27:04,483 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-18 23:27:04,727 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-18 23:27:04,942 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-18 23:27:05,281 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-12-18 23:27:05,478 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-12-18 23:27:05,715 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-18 23:27:05,914 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-18 23:27:06,142 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-18 23:27:06,421 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-18 23:27:06,691 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-18 23:27:07,037 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-12-18 23:27:07,351 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-12-18 23:27:07,680 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-12-18 23:27:07,985 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-12-18 23:27:08,457 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-12-18 23:27:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:08,687 INFO L93 Difference]: Finished difference Result 10394 states and 34730 transitions. [2019-12-18 23:27:08,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 23:27:08,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-12-18 23:27:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:08,703 INFO L225 Difference]: With dead ends: 10394 [2019-12-18 23:27:08,703 INFO L226 Difference]: Without dead ends: 10394 [2019-12-18 23:27:08,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1338, Invalid=3492, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 23:27:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10394 states. [2019-12-18 23:27:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10394 to 10164. [2019-12-18 23:27:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10164 states. [2019-12-18 23:27:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 34040 transitions. [2019-12-18 23:27:08,842 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 34040 transitions. Word has length 31 [2019-12-18 23:27:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:08,842 INFO L462 AbstractCegarLoop]: Abstraction has 10164 states and 34040 transitions. [2019-12-18 23:27:08,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:27:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 34040 transitions. [2019-12-18 23:27:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:27:08,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:08,852 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 23:27:08,852 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 23:27:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1713707043, now seen corresponding path program 3 times [2019-12-18 23:27:08,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:08,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315566506] [2019-12-18 23:27:08,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:09,741 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 23:27:09,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315566506] [2019-12-18 23:27:09,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:09,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:27:09,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956102062] [2019-12-18 23:27:09,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:27:09,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:27:09,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:27:09,743 INFO L87 Difference]: Start difference. First operand 10164 states and 34040 transitions. Second operand 19 states. [2019-12-18 23:27:11,289 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-18 23:27:11,665 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 23:27:12,008 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-12-18 23:27:12,189 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-12-18 23:27:12,816 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-18 23:27:13,184 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-18 23:27:13,385 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-18 23:27:13,591 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-18 23:27:13,988 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 23:27:14,568 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-12-18 23:27:14,767 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-18 23:27:15,042 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-12-18 23:27:15,273 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-18 23:27:15,575 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-12-18 23:27:15,859 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-18 23:27:16,233 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-18 23:27:16,525 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-12-18 23:27:16,778 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-12-18 23:27:16,998 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-18 23:27:17,223 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-12-18 23:27:17,509 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-18 23:27:17,762 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-18 23:27:18,053 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-12-18 23:27:18,299 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-18 23:27:18,658 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 87 [2019-12-18 23:27:18,935 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-18 23:27:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:19,142 INFO L93 Difference]: Finished difference Result 11104 states and 36850 transitions. [2019-12-18 23:27:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 23:27:19,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 23:27:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:19,162 INFO L225 Difference]: With dead ends: 11104 [2019-12-18 23:27:19,162 INFO L226 Difference]: Without dead ends: 11104 [2019-12-18 23:27:19,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=970, Invalid=2452, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 23:27:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2019-12-18 23:27:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10434. [2019-12-18 23:27:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-12-18 23:27:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 34870 transitions. [2019-12-18 23:27:19,357 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 34870 transitions. Word has length 31 [2019-12-18 23:27:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:19,358 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 34870 transitions. [2019-12-18 23:27:19,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:27:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 34870 transitions. [2019-12-18 23:27:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:27:19,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:19,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:27:19,367 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 23:27:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash -90243807, now seen corresponding path program 4 times [2019-12-18 23:27:19,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:19,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147430849] [2019-12-18 23:27:19,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:20,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 23:27:20,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147430849] [2019-12-18 23:27:20,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:20,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:27:20,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242406863] [2019-12-18 23:27:20,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:27:20,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:27:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:27:20,443 INFO L87 Difference]: Start difference. First operand 10434 states and 34870 transitions. Second operand 19 states. [2019-12-18 23:27:21,912 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-12-18 23:27:22,146 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-18 23:27:22,705 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-12-18 23:27:22,896 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-12-18 23:27:23,067 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-12-18 23:27:23,410 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-18 23:27:23,649 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 23:27:23,855 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-18 23:27:24,346 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 23:27:24,501 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 23:27:24,737 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-18 23:27:25,023 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-18 23:27:25,375 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-12-18 23:27:25,592 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-18 23:27:26,026 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 23:27:26,590 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-12-18 23:27:26,929 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-12-18 23:27:27,525 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-12-18 23:27:27,783 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-12-18 23:27:29,179 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-12-18 23:27:29,815 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-18 23:27:30,201 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-12-18 23:27:30,383 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-18 23:27:30,587 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-12-18 23:27:30,802 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-18 23:27:31,106 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-12-18 23:27:31,313 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-12-18 23:27:31,563 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-18 23:27:31,798 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-18 23:27:32,146 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-12-18 23:27:32,481 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 23:27:32,749 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-18 23:27:33,219 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-18 23:27:33,428 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-18 23:27:33,723 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-18 23:27:33,972 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-12-18 23:27:34,277 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2019-12-18 23:27:34,600 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-18 23:27:34,940 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-12-18 23:27:35,318 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-12-18 23:27:35,695 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2019-12-18 23:27:36,106 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-12-18 23:27:36,462 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 76 [2019-12-18 23:27:37,083 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 80 [2019-12-18 23:27:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:37,405 INFO L93 Difference]: Finished difference Result 12204 states and 40170 transitions. [2019-12-18 23:27:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-18 23:27:37,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 23:27:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:37,422 INFO L225 Difference]: With dead ends: 12204 [2019-12-18 23:27:37,422 INFO L226 Difference]: Without dead ends: 12204 [2019-12-18 23:27:37,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1810, Invalid=4996, Unknown=0, NotChecked=0, Total=6806 [2019-12-18 23:27:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12204 states. [2019-12-18 23:27:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12204 to 10624. [2019-12-18 23:27:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-12-18 23:27:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 35460 transitions. [2019-12-18 23:27:37,574 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 35460 transitions. Word has length 31 [2019-12-18 23:27:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:37,574 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 35460 transitions. [2019-12-18 23:27:37,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:27:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 35460 transitions. [2019-12-18 23:27:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:27:37,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:37,584 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 23:27:37,584 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 23:27:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1227210307, now seen corresponding path program 5 times [2019-12-18 23:27:37,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:37,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659853440] [2019-12-18 23:27:37,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:38,473 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 23:27:38,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659853440] [2019-12-18 23:27:38,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:38,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:27:38,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858285365] [2019-12-18 23:27:38,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:27:38,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:38,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:27:38,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:27:38,474 INFO L87 Difference]: Start difference. First operand 10624 states and 35460 transitions. Second operand 19 states. [2019-12-18 23:27:39,471 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-18 23:27:40,107 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-18 23:27:40,354 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-18 23:27:40,790 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-18 23:27:41,189 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-12-18 23:27:41,367 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-18 23:27:41,999 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-18 23:27:42,437 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-18 23:27:42,636 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-18 23:27:42,853 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-12-18 23:27:43,292 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 23:27:43,937 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-12-18 23:27:44,179 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-18 23:27:44,477 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-12-18 23:27:44,731 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-12-18 23:27:45,086 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-12-18 23:27:45,374 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-12-18 23:27:45,780 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-12-18 23:27:46,089 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-12-18 23:27:46,337 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-18 23:27:46,577 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-18 23:27:46,796 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-12-18 23:27:47,088 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-18 23:27:47,388 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-18 23:27:47,674 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-12-18 23:27:47,951 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-18 23:27:48,316 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 87 [2019-12-18 23:27:48,612 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-18 23:27:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:48,888 INFO L93 Difference]: Finished difference Result 11874 states and 39220 transitions. [2019-12-18 23:27:48,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 23:27:48,888 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-12-18 23:27:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:48,906 INFO L225 Difference]: With dead ends: 11874 [2019-12-18 23:27:48,906 INFO L226 Difference]: Without dead ends: 11874 [2019-12-18 23:27:48,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=993, Invalid=2547, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 23:27:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11874 states. [2019-12-18 23:27:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11874 to 10626. [2019-12-18 23:27:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-18 23:27:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 35466 transitions. [2019-12-18 23:27:49,052 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 35466 transitions. Word has length 31 [2019-12-18 23:27:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:49,052 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 35466 transitions. [2019-12-18 23:27:49,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:27:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 35466 transitions. [2019-12-18 23:27:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:27:49,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:49,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, 1, 1, 1, 1] [2019-12-18 23:27:49,062 INFO L410 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:27:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash -549236217, now seen corresponding path program 6 times [2019-12-18 23:27:49,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:49,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443120655] [2019-12-18 23:27:49,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:49,756 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-12-18 23:27:50,167 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 23:27:50,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443120655] [2019-12-18 23:27:50,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:27:50,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:27:50,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657706846] [2019-12-18 23:27:50,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:27:50,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:50,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:27:50,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:27:50,169 INFO L87 Difference]: Start difference. First operand 10626 states and 35466 transitions. Second operand 19 states. [2019-12-18 23:27:52,249 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-18 23:27:53,192 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-18 23:27:53,490 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-12-18 23:27:53,706 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-12-18 23:27:53,882 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-18 23:27:54,452 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 23:27:54,584 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-18 23:27:54,817 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 23:27:55,300 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-18 23:27:55,624 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-18 23:27:55,841 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-18 23:27:56,155 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 Received shutdown request... [2019-12-18 23:27:56,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 23:27:56,278 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:27:56,283 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:27:56,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:27:56 BasicIcfg [2019-12-18 23:27:56,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:27:56,285 INFO L168 Benchmark]: Toolchain (without parser) took 242712.85 ms. Allocated memory was 147.3 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.4 MB in the beginning and 980.0 MB in the end (delta: -878.6 MB). Peak memory consumption was 394.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,286 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1057.22 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 100.9 MB in the beginning and 126.8 MB in the end (delta: -25.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.01 ms. Allocated memory is still 205.5 MB. Free memory was 126.8 MB in the beginning and 123.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,287 INFO L168 Benchmark]: Boogie Preprocessor took 39.84 ms. Allocated memory is still 205.5 MB. Free memory was 123.6 MB in the beginning and 121.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,287 INFO L168 Benchmark]: RCFGBuilder took 730.19 ms. Allocated memory was 205.5 MB in the beginning and 235.9 MB in the end (delta: 30.4 MB). Free memory was 121.7 MB in the beginning and 194.2 MB in the end (delta: -72.5 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,287 INFO L168 Benchmark]: TraceAbstraction took 240791.37 ms. Allocated memory was 235.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 192.8 MB in the beginning and 980.0 MB in the end (delta: -787.2 MB). Peak memory consumption was 397.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:56,289 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.45 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1057.22 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 100.9 MB in the beginning and 126.8 MB in the end (delta: -25.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.01 ms. Allocated memory is still 205.5 MB. Free memory was 126.8 MB in the beginning and 123.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.84 ms. Allocated memory is still 205.5 MB. Free memory was 123.6 MB in the beginning and 121.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 730.19 ms. Allocated memory was 205.5 MB in the beginning and 235.9 MB in the end (delta: 30.4 MB). Free memory was 121.7 MB in the beginning and 194.2 MB in the end (delta: -72.5 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240791.37 ms. Allocated memory was 235.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 192.8 MB in the beginning and 980.0 MB in the end (delta: -787.2 MB). Peak memory consumption was 397.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 6 ChoiceCompositions, 7548 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 20948 CheckedPairsTotal, 149 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (10626states) and FLOYD_HOARE automaton (currently 38 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (508 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 (10626states) and FLOYD_HOARE automaton (currently 38 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (508 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 (10626states) and FLOYD_HOARE automaton (currently 38 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (508 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 (10626states) and FLOYD_HOARE automaton (currently 38 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (508 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 240.5s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 200.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3132 SDtfs, 14001 SDslu, 14687 SDs, 0 SdLazy, 85609 SolverSat, 1652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1421 GetRequests, 32 SyntacticMatches, 30 SemanticMatches, 1359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8453 ImplicationChecksByTransitivity, 115.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10782occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 42 MinimizatonAttempts, 97554 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 1170 NumberOfCodeBlocks, 1170 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 844571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown