/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 03:05:31,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 03:05:31,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 03:05:31,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 03:05:31,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 03:05:31,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 03:05:31,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 03:05:31,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 03:05:31,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 03:05:31,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 03:05:31,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 03:05:31,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 03:05:31,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 03:05:31,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 03:05:31,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 03:05:31,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 03:05:31,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 03:05:31,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 03:05:31,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 03:05:31,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 03:05:31,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 03:05:32,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 03:05:32,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 03:05:32,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 03:05:32,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 03:05:32,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 03:05:32,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 03:05:32,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 03:05:32,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 03:05:32,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 03:05:32,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 03:05:32,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 03:05:32,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 03:05:32,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 03:05:32,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 03:05:32,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 03:05:32,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 03:05:32,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 03:05:32,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 03:05:32,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 03:05:32,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 03:05:32,016 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 [2020-04-18 03:05:32,039 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 03:05:32,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 03:05:32,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 03:05:32,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 03:05:32,042 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 03:05:32,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 03:05:32,043 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 03:05:32,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 03:05:32,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 03:05:32,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 03:05:32,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 03:05:32,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 03:05:32,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 03:05:32,045 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 03:05:32,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 03:05:32,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 03:05:32,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 03:05:32,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 03:05:32,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 03:05:32,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 03:05:32,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 03:05:32,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 03:05:32,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 03:05:32,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 03:05:32,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 03:05:32,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-18 03:05:32,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 03:05:32,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 03:05:32,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 03:05:32,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 03:05:32,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 03:05:32,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 03:05:32,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 03:05:32,398 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 03:05:32,399 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 03:05:32,400 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2020-04-18 03:05:32,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735e82723/460f650c20574628b6c0a1256d9c5038/FLAG1e1318560 [2020-04-18 03:05:33,099 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 03:05:33,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2020-04-18 03:05:33,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735e82723/460f650c20574628b6c0a1256d9c5038/FLAG1e1318560 [2020-04-18 03:05:33,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735e82723/460f650c20574628b6c0a1256d9c5038 [2020-04-18 03:05:33,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 03:05:33,351 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 03:05:33,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 03:05:33,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 03:05:33,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 03:05:33,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:05:33" (1/1) ... [2020-04-18 03:05:33,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cfbb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:33, skipping insertion in model container [2020-04-18 03:05:33,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:05:33" (1/1) ... [2020-04-18 03:05:33,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 03:05:33,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 03:05:33,643 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-18 03:05:34,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 03:05:34,064 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 03:05:34,077 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-18 03:05:34,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 03:05:34,447 INFO L208 MainTranslator]: Completed translation [2020-04-18 03:05:34,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34 WrapperNode [2020-04-18 03:05:34,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 03:05:34,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 03:05:34,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 03:05:34,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 03:05:34,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 03:05:34,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 03:05:34,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 03:05:34,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 03:05:34,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (1/1) ... [2020-04-18 03:05:34,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 03:05:34,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 03:05:34,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 03:05:34,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 03:05:34,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (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 [2020-04-18 03:05:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-04-18 03:05:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-04-18 03:05:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-04-18 03:05:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-04-18 03:05:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 03:05:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 03:05:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 03:05:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 03:05:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 03:05:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 03:05:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 03:05:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 03:05:34,745 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 03:05:35,421 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 03:05:35,421 INFO L295 CfgBuilder]: Removed 22 assume(true) statements. [2020-04-18 03:05:35,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:05:35 BoogieIcfgContainer [2020-04-18 03:05:35,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 03:05:35,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 03:05:35,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 03:05:35,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 03:05:35,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:05:33" (1/3) ... [2020-04-18 03:05:35,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fe7ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:05:35, skipping insertion in model container [2020-04-18 03:05:35,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:05:34" (2/3) ... [2020-04-18 03:05:35,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fe7ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:05:35, skipping insertion in model container [2020-04-18 03:05:35,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:05:35" (3/3) ... [2020-04-18 03:05:35,435 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2020-04-18 03:05:35,447 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 03:05:35,447 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 03:05:35,455 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-04-18 03:05:35,456 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 03:05:35,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,503 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,509 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,510 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,510 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,510 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,511 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,512 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,513 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,513 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,513 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,514 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,514 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,515 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,516 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,516 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,516 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,516 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,516 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,516 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,517 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,517 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,517 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,517 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,517 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,523 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,528 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,528 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,529 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,531 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,531 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,532 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,535 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,535 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,536 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,536 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,542 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,542 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,543 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,544 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,544 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,544 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,545 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,546 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,546 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,546 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,546 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,547 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,547 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,548 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,549 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,549 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,549 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,550 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,550 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,552 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,552 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,552 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,552 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,553 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,554 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,554 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,554 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,555 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,556 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,556 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,556 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,557 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,558 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,559 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,559 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,560 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,560 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,561 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,562 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,562 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,562 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,562 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,562 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,562 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,563 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,563 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,563 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,563 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,563 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,564 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,565 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,565 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,565 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,565 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,565 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,565 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,566 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,566 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,566 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,566 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,566 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,567 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,567 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,567 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,567 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,567 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,571 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,572 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,572 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,573 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,573 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,578 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,578 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,579 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,579 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,580 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,580 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,581 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,581 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,582 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,582 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,583 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,583 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,583 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,583 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,584 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,586 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,595 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,596 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,596 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,597 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,597 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,597 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,598 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,598 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,599 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,599 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,599 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,599 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 03:05:35,621 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-04-18 03:05:35,643 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 03:05:35,643 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 03:05:35,643 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 03:05:35,644 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 03:05:35,644 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 03:05:35,644 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 03:05:35,644 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 03:05:35,644 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 03:05:35,671 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 201 transitions, 424 flow [2020-04-18 03:05:35,673 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions, 424 flow [2020-04-18 03:05:35,785 INFO L129 PetriNetUnfolder]: 18/201 cut-off events. [2020-04-18 03:05:35,785 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 03:05:35,795 INFO L80 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2020-04-18 03:05:35,811 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions, 424 flow [2020-04-18 03:05:35,897 INFO L129 PetriNetUnfolder]: 18/201 cut-off events. [2020-04-18 03:05:35,898 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 03:05:35,903 INFO L80 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2020-04-18 03:05:35,916 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16584 [2020-04-18 03:05:35,917 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 03:05:39,225 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-04-18 03:05:39,335 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-04-18 03:05:39,719 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-04-18 03:05:39,847 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-04-18 03:05:39,881 INFO L206 etLargeBlockEncoding]: Checked pairs total: 27552 [2020-04-18 03:05:39,881 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2020-04-18 03:05:39,885 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 65 transitions, 152 flow [2020-04-18 03:05:40,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2020-04-18 03:05:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2020-04-18 03:05:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 03:05:40,071 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:40,072 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:40,073 INFO L427 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -825162615, now seen corresponding path program 1 times [2020-04-18 03:05:40,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:40,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533787903] [2020-04-18 03:05:40,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:40,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533787903] [2020-04-18 03:05:40,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:40,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 03:05:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952611957] [2020-04-18 03:05:40,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 03:05:40,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 03:05:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-04-18 03:05:40,540 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 6 states. [2020-04-18 03:05:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:40,937 INFO L93 Difference]: Finished difference Result 2543 states and 8173 transitions. [2020-04-18 03:05:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 03:05:40,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-04-18 03:05:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:40,979 INFO L225 Difference]: With dead ends: 2543 [2020-04-18 03:05:40,979 INFO L226 Difference]: Without dead ends: 2405 [2020-04-18 03:05:40,981 INFO L678 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 [2020-04-18 03:05:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2020-04-18 03:05:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2020-04-18 03:05:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2020-04-18 03:05:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2020-04-18 03:05:41,171 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2020-04-18 03:05:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:41,171 INFO L479 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2020-04-18 03:05:41,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 03:05:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2020-04-18 03:05:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:05:41,175 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:41,175 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:41,175 INFO L427 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash -807595204, now seen corresponding path program 1 times [2020-04-18 03:05:41,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:41,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440715819] [2020-04-18 03:05:41,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:41,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440715819] [2020-04-18 03:05:41,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:41,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 03:05:41,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286463092] [2020-04-18 03:05:41,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 03:05:41,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:41,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 03:05:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-04-18 03:05:41,319 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2020-04-18 03:05:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:41,999 INFO L93 Difference]: Finished difference Result 3979 states and 13124 transitions. [2020-04-18 03:05:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 03:05:42,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-18 03:05:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:42,035 INFO L225 Difference]: With dead ends: 3979 [2020-04-18 03:05:42,035 INFO L226 Difference]: Without dead ends: 3939 [2020-04-18 03:05:42,038 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-04-18 03:05:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2020-04-18 03:05:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2948. [2020-04-18 03:05:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-04-18 03:05:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 9594 transitions. [2020-04-18 03:05:42,160 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 9594 transitions. Word has length 18 [2020-04-18 03:05:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:42,160 INFO L479 AbstractCegarLoop]: Abstraction has 2948 states and 9594 transitions. [2020-04-18 03:05:42,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 03:05:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 9594 transitions. [2020-04-18 03:05:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 03:05:42,165 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:42,165 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 03:05:42,165 INFO L427 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1728920918, now seen corresponding path program 2 times [2020-04-18 03:05:42,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:42,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954933725] [2020-04-18 03:05:42,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:42,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954933725] [2020-04-18 03:05:42,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:42,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 03:05:42,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949586200] [2020-04-18 03:05:42,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 03:05:42,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:42,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 03:05:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-04-18 03:05:42,413 INFO L87 Difference]: Start difference. First operand 2948 states and 9594 transitions. Second operand 7 states. [2020-04-18 03:05:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:42,926 INFO L93 Difference]: Finished difference Result 3485 states and 11281 transitions. [2020-04-18 03:05:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 03:05:42,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-18 03:05:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:42,951 INFO L225 Difference]: With dead ends: 3485 [2020-04-18 03:05:42,952 INFO L226 Difference]: Without dead ends: 3437 [2020-04-18 03:05:42,952 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-04-18 03:05:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-04-18 03:05:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2898. [2020-04-18 03:05:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2020-04-18 03:05:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2020-04-18 03:05:43,057 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2020-04-18 03:05:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:43,057 INFO L479 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2020-04-18 03:05:43,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 03:05:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2020-04-18 03:05:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:05:43,063 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:43,063 INFO L425 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] [2020-04-18 03:05:43,063 INFO L427 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2067850681, now seen corresponding path program 1 times [2020-04-18 03:05:43,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:43,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564463699] [2020-04-18 03:05:43,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:43,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564463699] [2020-04-18 03:05:43,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:43,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:05:43,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743146783] [2020-04-18 03:05:43,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:43,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:43,893 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 14 states. [2020-04-18 03:05:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:45,955 INFO L93 Difference]: Finished difference Result 3530 states and 11488 transitions. [2020-04-18 03:05:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 03:05:45,961 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:05:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:45,986 INFO L225 Difference]: With dead ends: 3530 [2020-04-18 03:05:45,986 INFO L226 Difference]: Without dead ends: 3530 [2020-04-18 03:05:45,987 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2020-04-18 03:05:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2020-04-18 03:05:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3024. [2020-04-18 03:05:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2020-04-18 03:05:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 9819 transitions. [2020-04-18 03:05:46,085 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 9819 transitions. Word has length 25 [2020-04-18 03:05:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:46,087 INFO L479 AbstractCegarLoop]: Abstraction has 3024 states and 9819 transitions. [2020-04-18 03:05:46,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 9819 transitions. [2020-04-18 03:05:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:05:46,093 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:46,093 INFO L425 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] [2020-04-18 03:05:46,093 INFO L427 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1809740468, now seen corresponding path program 1 times [2020-04-18 03:05:46,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:46,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621050213] [2020-04-18 03:05:46,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:46,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621050213] [2020-04-18 03:05:46,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:46,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:46,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814954152] [2020-04-18 03:05:46,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:05:46,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:05:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:05:46,669 INFO L87 Difference]: Start difference. First operand 3024 states and 9819 transitions. Second operand 13 states. [2020-04-18 03:05:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:47,817 INFO L93 Difference]: Finished difference Result 3115 states and 10104 transitions. [2020-04-18 03:05:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 03:05:47,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:05:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:47,838 INFO L225 Difference]: With dead ends: 3115 [2020-04-18 03:05:47,838 INFO L226 Difference]: Without dead ends: 3115 [2020-04-18 03:05:47,839 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2020-04-18 03:05:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2020-04-18 03:05:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3103. [2020-04-18 03:05:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3103 states. [2020-04-18 03:05:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 10079 transitions. [2020-04-18 03:05:47,922 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 10079 transitions. Word has length 25 [2020-04-18 03:05:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:47,922 INFO L479 AbstractCegarLoop]: Abstraction has 3103 states and 10079 transitions. [2020-04-18 03:05:47,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:05:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 10079 transitions. [2020-04-18 03:05:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:05:47,928 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:47,929 INFO L425 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] [2020-04-18 03:05:47,929 INFO L427 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash 430278225, now seen corresponding path program 2 times [2020-04-18 03:05:47,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:47,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664319277] [2020-04-18 03:05:47,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:48,410 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2020-04-18 03:05:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:48,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664319277] [2020-04-18 03:05:48,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:48,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:05:48,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873688952] [2020-04-18 03:05:48,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:48,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:48,629 INFO L87 Difference]: Start difference. First operand 3103 states and 10079 transitions. Second operand 14 states. [2020-04-18 03:05:50,439 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-18 03:05:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:50,854 INFO L93 Difference]: Finished difference Result 3700 states and 12029 transitions. [2020-04-18 03:05:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-18 03:05:50,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:05:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:50,872 INFO L225 Difference]: With dead ends: 3700 [2020-04-18 03:05:50,873 INFO L226 Difference]: Without dead ends: 3700 [2020-04-18 03:05:50,873 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2020-04-18 03:05:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2020-04-18 03:05:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3173. [2020-04-18 03:05:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3173 states. [2020-04-18 03:05:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 10358 transitions. [2020-04-18 03:05:50,967 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 10358 transitions. Word has length 25 [2020-04-18 03:05:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:50,967 INFO L479 AbstractCegarLoop]: Abstraction has 3173 states and 10358 transitions. [2020-04-18 03:05:50,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 10358 transitions. [2020-04-18 03:05:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:05:50,973 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:50,973 INFO L425 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] [2020-04-18 03:05:50,974 INFO L427 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash -78693817, now seen corresponding path program 3 times [2020-04-18 03:05:50,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:50,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359214573] [2020-04-18 03:05:50,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:51,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359214573] [2020-04-18 03:05:51,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:51,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:05:51,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266565117] [2020-04-18 03:05:51,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:51,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:51,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:51,559 INFO L87 Difference]: Start difference. First operand 3173 states and 10358 transitions. Second operand 14 states. [2020-04-18 03:05:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:54,317 INFO L93 Difference]: Finished difference Result 3641 states and 11754 transitions. [2020-04-18 03:05:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:05:54,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:05:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:54,335 INFO L225 Difference]: With dead ends: 3641 [2020-04-18 03:05:54,335 INFO L226 Difference]: Without dead ends: 3641 [2020-04-18 03:05:54,336 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:05:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2020-04-18 03:05:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3383. [2020-04-18 03:05:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3383 states. [2020-04-18 03:05:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 11015 transitions. [2020-04-18 03:05:54,458 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 11015 transitions. Word has length 25 [2020-04-18 03:05:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:54,460 INFO L479 AbstractCegarLoop]: Abstraction has 3383 states and 11015 transitions. [2020-04-18 03:05:54,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 11015 transitions. [2020-04-18 03:05:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:05:54,468 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:54,469 INFO L425 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] [2020-04-18 03:05:54,469 INFO L427 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash -675763345, now seen corresponding path program 4 times [2020-04-18 03:05:54,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:54,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834751158] [2020-04-18 03:05:54,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:55,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834751158] [2020-04-18 03:05:55,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:55,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:05:55,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878034436] [2020-04-18 03:05:55,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:05:55,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:05:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:05:55,082 INFO L87 Difference]: Start difference. First operand 3383 states and 11015 transitions. Second operand 14 states. [2020-04-18 03:05:57,320 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2020-04-18 03:05:57,474 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2020-04-18 03:05:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:05:57,931 INFO L93 Difference]: Finished difference Result 3593 states and 11602 transitions. [2020-04-18 03:05:57,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:05:57,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:05:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:05:57,944 INFO L225 Difference]: With dead ends: 3593 [2020-04-18 03:05:57,944 INFO L226 Difference]: Without dead ends: 3593 [2020-04-18 03:05:57,945 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:05:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2020-04-18 03:05:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3454. [2020-04-18 03:05:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2020-04-18 03:05:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 11236 transitions. [2020-04-18 03:05:58,037 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 11236 transitions. Word has length 25 [2020-04-18 03:05:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:05:58,038 INFO L479 AbstractCegarLoop]: Abstraction has 3454 states and 11236 transitions. [2020-04-18 03:05:58,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:05:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 11236 transitions. [2020-04-18 03:05:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:05:58,046 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:05:58,046 INFO L425 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] [2020-04-18 03:05:58,046 INFO L427 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:05:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:05:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1056851865, now seen corresponding path program 5 times [2020-04-18 03:05:58,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:05:58,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549481672] [2020-04-18 03:05:58,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:05:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:05:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:05:58,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549481672] [2020-04-18 03:05:58,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:05:58,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:05:58,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093217414] [2020-04-18 03:05:58,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:05:58,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:05:58,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:05:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:05:58,525 INFO L87 Difference]: Start difference. First operand 3454 states and 11236 transitions. Second operand 13 states. [2020-04-18 03:06:00,210 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-04-18 03:06:00,448 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2020-04-18 03:06:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:00,674 INFO L93 Difference]: Finished difference Result 3659 states and 11816 transitions. [2020-04-18 03:06:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 03:06:00,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:06:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:00,686 INFO L225 Difference]: With dead ends: 3659 [2020-04-18 03:06:00,686 INFO L226 Difference]: Without dead ends: 3659 [2020-04-18 03:06:00,687 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:06:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2020-04-18 03:06:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3537. [2020-04-18 03:06:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3537 states. [2020-04-18 03:06:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 11498 transitions. [2020-04-18 03:06:00,783 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 11498 transitions. Word has length 25 [2020-04-18 03:06:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:00,783 INFO L479 AbstractCegarLoop]: Abstraction has 3537 states and 11498 transitions. [2020-04-18 03:06:00,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 11498 transitions. [2020-04-18 03:06:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:00,791 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:00,791 INFO L425 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] [2020-04-18 03:06:00,792 INFO L427 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1579015134, now seen corresponding path program 2 times [2020-04-18 03:06:00,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:00,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316684761] [2020-04-18 03:06:00,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:01,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316684761] [2020-04-18 03:06:01,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:01,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:06:01,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596776239] [2020-04-18 03:06:01,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:01,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:01,289 INFO L87 Difference]: Start difference. First operand 3537 states and 11498 transitions. Second operand 13 states. [2020-04-18 03:06:01,933 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-04-18 03:06:02,291 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-04-18 03:06:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:02,779 INFO L93 Difference]: Finished difference Result 4074 states and 13237 transitions. [2020-04-18 03:06:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 03:06:02,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:06:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:02,790 INFO L225 Difference]: With dead ends: 4074 [2020-04-18 03:06:02,790 INFO L226 Difference]: Without dead ends: 4074 [2020-04-18 03:06:02,791 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2020-04-18 03:06:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2020-04-18 03:06:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 3594. [2020-04-18 03:06:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2020-04-18 03:06:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11725 transitions. [2020-04-18 03:06:02,883 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11725 transitions. Word has length 25 [2020-04-18 03:06:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:02,883 INFO L479 AbstractCegarLoop]: Abstraction has 3594 states and 11725 transitions. [2020-04-18 03:06:02,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11725 transitions. [2020-04-18 03:06:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:02,891 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:02,891 INFO L425 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] [2020-04-18 03:06:02,891 INFO L427 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1703259630, now seen corresponding path program 3 times [2020-04-18 03:06:02,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:02,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784639794] [2020-04-18 03:06:02,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:03,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784639794] [2020-04-18 03:06:03,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:03,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:06:03,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435981464] [2020-04-18 03:06:03,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:03,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:03,425 INFO L87 Difference]: Start difference. First operand 3594 states and 11725 transitions. Second operand 13 states. [2020-04-18 03:06:04,381 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2020-04-18 03:06:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:05,065 INFO L93 Difference]: Finished difference Result 4023 states and 13077 transitions. [2020-04-18 03:06:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-18 03:06:05,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:06:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:05,073 INFO L225 Difference]: With dead ends: 4023 [2020-04-18 03:06:05,073 INFO L226 Difference]: Without dead ends: 4023 [2020-04-18 03:06:05,074 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2020-04-18 03:06:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2020-04-18 03:06:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 3778. [2020-04-18 03:06:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3778 states. [2020-04-18 03:06:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 12373 transitions. [2020-04-18 03:06:05,162 INFO L78 Accepts]: Start accepts. Automaton has 3778 states and 12373 transitions. Word has length 25 [2020-04-18 03:06:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:05,162 INFO L479 AbstractCegarLoop]: Abstraction has 3778 states and 12373 transitions. [2020-04-18 03:06:05,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 12373 transitions. [2020-04-18 03:06:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:05,170 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:05,170 INFO L425 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] [2020-04-18 03:06:05,171 INFO L427 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1645369854, now seen corresponding path program 4 times [2020-04-18 03:06:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:05,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928343274] [2020-04-18 03:06:05,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:05,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928343274] [2020-04-18 03:06:05,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:05,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:06:05,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652433882] [2020-04-18 03:06:05,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:06:05,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:06:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:06:05,539 INFO L87 Difference]: Start difference. First operand 3778 states and 12373 transitions. Second operand 12 states. [2020-04-18 03:06:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:07,417 INFO L93 Difference]: Finished difference Result 4048 states and 13033 transitions. [2020-04-18 03:06:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 03:06:07,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-18 03:06:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:07,423 INFO L225 Difference]: With dead ends: 4048 [2020-04-18 03:06:07,423 INFO L226 Difference]: Without dead ends: 4048 [2020-04-18 03:06:07,424 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2020-04-18 03:06:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2020-04-18 03:06:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3948. [2020-04-18 03:06:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-04-18 03:06:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2020-04-18 03:06:07,503 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2020-04-18 03:06:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:07,503 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2020-04-18 03:06:07,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:06:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2020-04-18 03:06:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:07,510 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:07,510 INFO L425 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] [2020-04-18 03:06:07,510 INFO L427 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 261726937, now seen corresponding path program 6 times [2020-04-18 03:06:07,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:07,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774227733] [2020-04-18 03:06:07,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:08,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774227733] [2020-04-18 03:06:08,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:08,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:08,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190229374] [2020-04-18 03:06:08,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:08,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:08,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:08,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:08,072 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 14 states. [2020-04-18 03:06:09,228 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-04-18 03:06:09,446 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-04-18 03:06:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:09,916 INFO L93 Difference]: Finished difference Result 4093 states and 13165 transitions. [2020-04-18 03:06:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 03:06:09,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:09,923 INFO L225 Difference]: With dead ends: 4093 [2020-04-18 03:06:09,923 INFO L226 Difference]: Without dead ends: 4093 [2020-04-18 03:06:09,923 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2020-04-18 03:06:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2020-04-18 03:06:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4022. [2020-04-18 03:06:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2020-04-18 03:06:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 13022 transitions. [2020-04-18 03:06:10,079 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 13022 transitions. Word has length 25 [2020-04-18 03:06:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:10,080 INFO L479 AbstractCegarLoop]: Abstraction has 4022 states and 13022 transitions. [2020-04-18 03:06:10,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 13022 transitions. [2020-04-18 03:06:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:10,090 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:10,090 INFO L425 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] [2020-04-18 03:06:10,090 INFO L427 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1375845519, now seen corresponding path program 7 times [2020-04-18 03:06:10,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:10,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596273277] [2020-04-18 03:06:10,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:10,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596273277] [2020-04-18 03:06:10,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:10,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:10,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610270264] [2020-04-18 03:06:10,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:10,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:10,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:10,724 INFO L87 Difference]: Start difference. First operand 4022 states and 13022 transitions. Second operand 14 states. [2020-04-18 03:06:12,356 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2020-04-18 03:06:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:12,788 INFO L93 Difference]: Finished difference Result 4865 states and 15721 transitions. [2020-04-18 03:06:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 03:06:12,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:12,796 INFO L225 Difference]: With dead ends: 4865 [2020-04-18 03:06:12,796 INFO L226 Difference]: Without dead ends: 4865 [2020-04-18 03:06:12,797 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2020-04-18 03:06:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2020-04-18 03:06:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4130. [2020-04-18 03:06:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2020-04-18 03:06:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 13463 transitions. [2020-04-18 03:06:12,893 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 13463 transitions. Word has length 25 [2020-04-18 03:06:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:12,893 INFO L479 AbstractCegarLoop]: Abstraction has 4130 states and 13463 transitions. [2020-04-18 03:06:12,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 13463 transitions. [2020-04-18 03:06:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:12,902 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:12,902 INFO L425 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] [2020-04-18 03:06:12,902 INFO L427 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1884817561, now seen corresponding path program 8 times [2020-04-18 03:06:12,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:12,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192563878] [2020-04-18 03:06:12,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:13,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192563878] [2020-04-18 03:06:13,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:13,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:13,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071280551] [2020-04-18 03:06:13,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:13,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:13,408 INFO L87 Difference]: Start difference. First operand 4130 states and 13463 transitions. Second operand 14 states. [2020-04-18 03:06:15,154 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-04-18 03:06:15,417 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-04-18 03:06:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:15,822 INFO L93 Difference]: Finished difference Result 4806 states and 15415 transitions. [2020-04-18 03:06:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:06:15,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:15,830 INFO L225 Difference]: With dead ends: 4806 [2020-04-18 03:06:15,830 INFO L226 Difference]: Without dead ends: 4806 [2020-04-18 03:06:15,831 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2020-04-18 03:06:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2020-04-18 03:06:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4454. [2020-04-18 03:06:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2020-04-18 03:06:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 14489 transitions. [2020-04-18 03:06:15,916 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 14489 transitions. Word has length 25 [2020-04-18 03:06:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:15,916 INFO L479 AbstractCegarLoop]: Abstraction has 4454 states and 14489 transitions. [2020-04-18 03:06:15,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 14489 transitions. [2020-04-18 03:06:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:15,924 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:15,925 INFO L425 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] [2020-04-18 03:06:15,925 INFO L427 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1813080207, now seen corresponding path program 9 times [2020-04-18 03:06:15,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:15,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013838104] [2020-04-18 03:06:15,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:16,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013838104] [2020-04-18 03:06:16,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:16,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:16,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185363597] [2020-04-18 03:06:16,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:16,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:16,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:16,456 INFO L87 Difference]: Start difference. First operand 4454 states and 14489 transitions. Second operand 14 states. [2020-04-18 03:06:18,607 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-04-18 03:06:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:19,007 INFO L93 Difference]: Finished difference Result 4758 states and 15263 transitions. [2020-04-18 03:06:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:06:19,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:19,016 INFO L225 Difference]: With dead ends: 4758 [2020-04-18 03:06:19,016 INFO L226 Difference]: Without dead ends: 4758 [2020-04-18 03:06:19,017 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-04-18 03:06:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2020-04-18 03:06:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4562. [2020-04-18 03:06:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4562 states. [2020-04-18 03:06:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 14831 transitions. [2020-04-18 03:06:19,082 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 14831 transitions. Word has length 25 [2020-04-18 03:06:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:19,082 INFO L479 AbstractCegarLoop]: Abstraction has 4562 states and 14831 transitions. [2020-04-18 03:06:19,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 14831 transitions. [2020-04-18 03:06:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:19,091 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:19,091 INFO L425 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] [2020-04-18 03:06:19,091 INFO L427 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:19,091 INFO L82 PathProgramCache]: Analyzing trace with hash -749271879, now seen corresponding path program 10 times [2020-04-18 03:06:19,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:19,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022528157] [2020-04-18 03:06:19,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:19,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022528157] [2020-04-18 03:06:19,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:19,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:19,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579666033] [2020-04-18 03:06:19,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:19,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:19,604 INFO L87 Difference]: Start difference. First operand 4562 states and 14831 transitions. Second operand 14 states. [2020-04-18 03:06:21,847 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-04-18 03:06:22,101 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-04-18 03:06:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:22,422 INFO L93 Difference]: Finished difference Result 5362 states and 17081 transitions. [2020-04-18 03:06:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-18 03:06:22,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:22,432 INFO L225 Difference]: With dead ends: 5362 [2020-04-18 03:06:22,433 INFO L226 Difference]: Without dead ends: 5362 [2020-04-18 03:06:22,433 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:06:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2020-04-18 03:06:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4128. [2020-04-18 03:06:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2020-04-18 03:06:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 13467 transitions. [2020-04-18 03:06:22,521 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 13467 transitions. Word has length 25 [2020-04-18 03:06:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:22,522 INFO L479 AbstractCegarLoop]: Abstraction has 4128 states and 13467 transitions. [2020-04-18 03:06:22,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 13467 transitions. [2020-04-18 03:06:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:22,529 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:22,529 INFO L425 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] [2020-04-18 03:06:22,529 INFO L427 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:22,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1866891123, now seen corresponding path program 11 times [2020-04-18 03:06:22,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:22,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698580133] [2020-04-18 03:06:22,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:23,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698580133] [2020-04-18 03:06:23,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:23,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:23,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593615754] [2020-04-18 03:06:23,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:23,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:23,138 INFO L87 Difference]: Start difference. First operand 4128 states and 13467 transitions. Second operand 14 states. [2020-04-18 03:06:24,508 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2020-04-18 03:06:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:24,860 INFO L93 Difference]: Finished difference Result 4300 states and 13893 transitions. [2020-04-18 03:06:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 03:06:24,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:24,867 INFO L225 Difference]: With dead ends: 4300 [2020-04-18 03:06:24,867 INFO L226 Difference]: Without dead ends: 4300 [2020-04-18 03:06:24,868 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-04-18 03:06:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2020-04-18 03:06:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4190. [2020-04-18 03:06:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2020-04-18 03:06:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 13663 transitions. [2020-04-18 03:06:24,947 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 13663 transitions. Word has length 25 [2020-04-18 03:06:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:24,948 INFO L479 AbstractCegarLoop]: Abstraction has 4190 states and 13663 transitions. [2020-04-18 03:06:24,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 13663 transitions. [2020-04-18 03:06:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:24,954 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:24,954 INFO L425 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] [2020-04-18 03:06:24,954 INFO L427 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1357919081, now seen corresponding path program 12 times [2020-04-18 03:06:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:24,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518496566] [2020-04-18 03:06:24,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:25,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518496566] [2020-04-18 03:06:25,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:25,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:25,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701411353] [2020-04-18 03:06:25,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:25,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:25,377 INFO L87 Difference]: Start difference. First operand 4190 states and 13663 transitions. Second operand 14 states. [2020-04-18 03:06:27,008 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-04-18 03:06:27,271 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-04-18 03:06:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:27,659 INFO L93 Difference]: Finished difference Result 4806 states and 15495 transitions. [2020-04-18 03:06:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 03:06:27,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:27,667 INFO L225 Difference]: With dead ends: 4806 [2020-04-18 03:06:27,667 INFO L226 Difference]: Without dead ends: 4806 [2020-04-18 03:06:27,667 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:06:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2020-04-18 03:06:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4514. [2020-04-18 03:06:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2020-04-18 03:06:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 14689 transitions. [2020-04-18 03:06:27,729 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 14689 transitions. Word has length 25 [2020-04-18 03:06:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:27,729 INFO L479 AbstractCegarLoop]: Abstraction has 4514 states and 14689 transitions. [2020-04-18 03:06:27,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 14689 transitions. [2020-04-18 03:06:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:27,735 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:27,735 INFO L425 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] [2020-04-18 03:06:27,735 INFO L427 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash 760849553, now seen corresponding path program 13 times [2020-04-18 03:06:27,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:27,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825407078] [2020-04-18 03:06:27,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:28,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825407078] [2020-04-18 03:06:28,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:28,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:28,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990967426] [2020-04-18 03:06:28,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:28,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:28,138 INFO L87 Difference]: Start difference. First operand 4514 states and 14689 transitions. Second operand 14 states. [2020-04-18 03:06:30,024 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-04-18 03:06:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:30,383 INFO L93 Difference]: Finished difference Result 4758 states and 15343 transitions. [2020-04-18 03:06:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 03:06:30,383 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:30,390 INFO L225 Difference]: With dead ends: 4758 [2020-04-18 03:06:30,390 INFO L226 Difference]: Without dead ends: 4758 [2020-04-18 03:06:30,391 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:06:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2020-04-18 03:06:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4622. [2020-04-18 03:06:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2020-04-18 03:06:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 15031 transitions. [2020-04-18 03:06:30,451 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 15031 transitions. Word has length 25 [2020-04-18 03:06:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:30,451 INFO L479 AbstractCegarLoop]: Abstraction has 4622 states and 15031 transitions. [2020-04-18 03:06:30,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 15031 transitions. [2020-04-18 03:06:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:30,519 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:30,519 INFO L425 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] [2020-04-18 03:06:30,519 INFO L427 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1801502533, now seen corresponding path program 14 times [2020-04-18 03:06:30,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:30,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273768867] [2020-04-18 03:06:30,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:30,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273768867] [2020-04-18 03:06:30,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:30,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:30,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797034388] [2020-04-18 03:06:30,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:30,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:30,960 INFO L87 Difference]: Start difference. First operand 4622 states and 15031 transitions. Second operand 14 states. [2020-04-18 03:06:33,648 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-18 03:06:33,926 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-04-18 03:06:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:34,315 INFO L93 Difference]: Finished difference Result 5362 states and 17161 transitions. [2020-04-18 03:06:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-18 03:06:34,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:34,325 INFO L225 Difference]: With dead ends: 5362 [2020-04-18 03:06:34,325 INFO L226 Difference]: Without dead ends: 5362 [2020-04-18 03:06:34,325 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2020-04-18 03:06:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2020-04-18 03:06:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4008. [2020-04-18 03:06:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2020-04-18 03:06:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 12977 transitions. [2020-04-18 03:06:34,390 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 12977 transitions. Word has length 25 [2020-04-18 03:06:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:34,390 INFO L479 AbstractCegarLoop]: Abstraction has 4008 states and 12977 transitions. [2020-04-18 03:06:34,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 12977 transitions. [2020-04-18 03:06:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:34,397 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:34,397 INFO L425 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] [2020-04-18 03:06:34,397 INFO L427 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1760795763, now seen corresponding path program 15 times [2020-04-18 03:06:34,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:34,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612299662] [2020-04-18 03:06:34,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:34,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612299662] [2020-04-18 03:06:34,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:34,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:34,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794970200] [2020-04-18 03:06:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:34,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:34,900 INFO L87 Difference]: Start difference. First operand 4008 states and 12977 transitions. Second operand 14 states. [2020-04-18 03:06:36,038 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-04-18 03:06:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:36,584 INFO L93 Difference]: Finished difference Result 4166 states and 13350 transitions. [2020-04-18 03:06:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-04-18 03:06:36,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:36,591 INFO L225 Difference]: With dead ends: 4166 [2020-04-18 03:06:36,592 INFO L226 Difference]: Without dead ends: 4166 [2020-04-18 03:06:36,593 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-04-18 03:06:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2020-04-18 03:06:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4166. [2020-04-18 03:06:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2020-04-18 03:06:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 13350 transitions. [2020-04-18 03:06:36,653 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 13350 transitions. Word has length 25 [2020-04-18 03:06:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:36,653 INFO L479 AbstractCegarLoop]: Abstraction has 4166 states and 13350 transitions. [2020-04-18 03:06:36,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 13350 transitions. [2020-04-18 03:06:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:36,658 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:36,659 INFO L425 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] [2020-04-18 03:06:36,659 INFO L427 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -768095385, now seen corresponding path program 16 times [2020-04-18 03:06:36,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:36,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226269172] [2020-04-18 03:06:36,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:37,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226269172] [2020-04-18 03:06:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:37,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:37,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824060720] [2020-04-18 03:06:37,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:37,122 INFO L87 Difference]: Start difference. First operand 4166 states and 13350 transitions. Second operand 14 states. [2020-04-18 03:06:38,705 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-04-18 03:06:38,878 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2020-04-18 03:06:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:39,189 INFO L93 Difference]: Finished difference Result 4192 states and 13432 transitions. [2020-04-18 03:06:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 03:06:39,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:39,197 INFO L225 Difference]: With dead ends: 4192 [2020-04-18 03:06:39,197 INFO L226 Difference]: Without dead ends: 4192 [2020-04-18 03:06:39,197 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2020-04-18 03:06:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2020-04-18 03:06:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4034. [2020-04-18 03:06:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2020-04-18 03:06:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 12932 transitions. [2020-04-18 03:06:39,253 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 12932 transitions. Word has length 25 [2020-04-18 03:06:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:39,253 INFO L479 AbstractCegarLoop]: Abstraction has 4034 states and 12932 transitions. [2020-04-18 03:06:39,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 12932 transitions. [2020-04-18 03:06:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:39,258 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:39,258 INFO L425 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] [2020-04-18 03:06:39,258 INFO L427 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1163726235, now seen corresponding path program 17 times [2020-04-18 03:06:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:39,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547590887] [2020-04-18 03:06:39,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:39,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547590887] [2020-04-18 03:06:39,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:39,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:39,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15677789] [2020-04-18 03:06:39,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:39,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:39,700 INFO L87 Difference]: Start difference. First operand 4034 states and 12932 transitions. Second operand 14 states. [2020-04-18 03:06:41,851 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2020-04-18 03:06:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:42,224 INFO L93 Difference]: Finished difference Result 4168 states and 13356 transitions. [2020-04-18 03:06:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 03:06:42,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:42,234 INFO L225 Difference]: With dead ends: 4168 [2020-04-18 03:06:42,234 INFO L226 Difference]: Without dead ends: 4168 [2020-04-18 03:06:42,234 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:06:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2020-04-18 03:06:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4142. [2020-04-18 03:06:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-04-18 03:06:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 13274 transitions. [2020-04-18 03:06:42,287 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 13274 transitions. Word has length 25 [2020-04-18 03:06:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:42,287 INFO L479 AbstractCegarLoop]: Abstraction has 4142 states and 13274 transitions. [2020-04-18 03:06:42,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 13274 transitions. [2020-04-18 03:06:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:42,293 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:42,293 INFO L425 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] [2020-04-18 03:06:42,293 INFO L427 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1398625851, now seen corresponding path program 18 times [2020-04-18 03:06:42,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:42,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107261903] [2020-04-18 03:06:42,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:42,684 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2020-04-18 03:06:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:42,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107261903] [2020-04-18 03:06:42,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:42,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:42,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634867892] [2020-04-18 03:06:42,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:42,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:42,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:42,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:42,889 INFO L87 Difference]: Start difference. First operand 4142 states and 13274 transitions. Second operand 14 states. [2020-04-18 03:06:45,896 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2020-04-18 03:06:46,513 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-04-18 03:06:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:46,910 INFO L93 Difference]: Finished difference Result 4772 states and 15174 transitions. [2020-04-18 03:06:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-18 03:06:46,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:46,918 INFO L225 Difference]: With dead ends: 4772 [2020-04-18 03:06:46,918 INFO L226 Difference]: Without dead ends: 4772 [2020-04-18 03:06:46,919 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=346, Invalid=776, Unknown=0, NotChecked=0, Total=1122 [2020-04-18 03:06:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2020-04-18 03:06:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 3648. [2020-04-18 03:06:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2020-04-18 03:06:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 11710 transitions. [2020-04-18 03:06:46,971 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 11710 transitions. Word has length 25 [2020-04-18 03:06:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:46,971 INFO L479 AbstractCegarLoop]: Abstraction has 3648 states and 11710 transitions. [2020-04-18 03:06:46,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 11710 transitions. [2020-04-18 03:06:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:46,975 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:46,975 INFO L425 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] [2020-04-18 03:06:46,976 INFO L427 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash -255776589, now seen corresponding path program 19 times [2020-04-18 03:06:46,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:46,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428403788] [2020-04-18 03:06:46,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:47,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428403788] [2020-04-18 03:06:47,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:47,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:47,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292341633] [2020-04-18 03:06:47,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:47,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:47,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:47,462 INFO L87 Difference]: Start difference. First operand 3648 states and 11710 transitions. Second operand 14 states. [2020-04-18 03:06:49,031 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-04-18 03:06:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:49,305 INFO L93 Difference]: Finished difference Result 3662 states and 11754 transitions. [2020-04-18 03:06:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 03:06:49,305 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:49,311 INFO L225 Difference]: With dead ends: 3662 [2020-04-18 03:06:49,311 INFO L226 Difference]: Without dead ends: 3662 [2020-04-18 03:06:49,311 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2020-04-18 03:06:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2020-04-18 03:06:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2020-04-18 03:06:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2020-04-18 03:06:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 11754 transitions. [2020-04-18 03:06:49,358 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 11754 transitions. Word has length 25 [2020-04-18 03:06:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:49,358 INFO L479 AbstractCegarLoop]: Abstraction has 3662 states and 11754 transitions. [2020-04-18 03:06:49,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 11754 transitions. [2020-04-18 03:06:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:49,362 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:49,362 INFO L425 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] [2020-04-18 03:06:49,362 INFO L427 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:49,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1476838621, now seen corresponding path program 20 times [2020-04-18 03:06:49,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:49,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508803508] [2020-04-18 03:06:49,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:49,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508803508] [2020-04-18 03:06:49,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:49,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:06:49,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962524769] [2020-04-18 03:06:49,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 03:06:49,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 03:06:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-04-18 03:06:49,863 INFO L87 Difference]: Start difference. First operand 3662 states and 11754 transitions. Second operand 14 states. [2020-04-18 03:06:53,065 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2020-04-18 03:06:53,248 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2020-04-18 03:06:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:53,595 INFO L93 Difference]: Finished difference Result 4446 states and 14138 transitions. [2020-04-18 03:06:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-18 03:06:53,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-18 03:06:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:53,602 INFO L225 Difference]: With dead ends: 4446 [2020-04-18 03:06:53,602 INFO L226 Difference]: Without dead ends: 4446 [2020-04-18 03:06:53,603 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=320, Invalid=736, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 03:06:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2020-04-18 03:06:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 3542. [2020-04-18 03:06:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2020-04-18 03:06:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2020-04-18 03:06:53,658 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2020-04-18 03:06:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:53,658 INFO L479 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2020-04-18 03:06:53,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 03:06:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2020-04-18 03:06:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:53,661 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:53,661 INFO L425 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] [2020-04-18 03:06:53,661 INFO L427 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1393446354, now seen corresponding path program 5 times [2020-04-18 03:06:53,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:53,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058502283] [2020-04-18 03:06:53,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:54,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058502283] [2020-04-18 03:06:54,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:54,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:06:54,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230924323] [2020-04-18 03:06:54,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:54,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:54,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:54,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:54,087 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 13 states. [2020-04-18 03:06:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:55,578 INFO L93 Difference]: Finished difference Result 3644 states and 11622 transitions. [2020-04-18 03:06:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 03:06:55,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:06:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:55,584 INFO L225 Difference]: With dead ends: 3644 [2020-04-18 03:06:55,585 INFO L226 Difference]: Without dead ends: 3644 [2020-04-18 03:06:55,585 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2020-04-18 03:06:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2020-04-18 03:06:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3584. [2020-04-18 03:06:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2020-04-18 03:06:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11502 transitions. [2020-04-18 03:06:55,639 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11502 transitions. Word has length 25 [2020-04-18 03:06:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:55,640 INFO L479 AbstractCegarLoop]: Abstraction has 3584 states and 11502 transitions. [2020-04-18 03:06:55,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11502 transitions. [2020-04-18 03:06:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:55,644 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:55,644 INFO L425 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] [2020-04-18 03:06:55,644 INFO L427 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1888828410, now seen corresponding path program 6 times [2020-04-18 03:06:55,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:55,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754979631] [2020-04-18 03:06:55,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:56,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754979631] [2020-04-18 03:06:56,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:56,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:06:56,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450022559] [2020-04-18 03:06:56,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:06:56,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:06:56,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:06:56,219 INFO L87 Difference]: Start difference. First operand 3584 states and 11502 transitions. Second operand 13 states. [2020-04-18 03:06:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:06:57,763 INFO L93 Difference]: Finished difference Result 3952 states and 12618 transitions. [2020-04-18 03:06:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 03:06:57,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:06:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:06:57,770 INFO L225 Difference]: With dead ends: 3952 [2020-04-18 03:06:57,770 INFO L226 Difference]: Without dead ends: 3952 [2020-04-18 03:06:57,771 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-04-18 03:06:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2020-04-18 03:06:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3780. [2020-04-18 03:06:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2020-04-18 03:06:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 12160 transitions. [2020-04-18 03:06:57,827 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 12160 transitions. Word has length 25 [2020-04-18 03:06:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:06:57,827 INFO L479 AbstractCegarLoop]: Abstraction has 3780 states and 12160 transitions. [2020-04-18 03:06:57,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:06:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 12160 transitions. [2020-04-18 03:06:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:06:57,831 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:06:57,831 INFO L425 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] [2020-04-18 03:06:57,831 INFO L427 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:06:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:06:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1830938634, now seen corresponding path program 7 times [2020-04-18 03:06:57,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:06:57,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865949893] [2020-04-18 03:06:57,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:06:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:06:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:06:58,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865949893] [2020-04-18 03:06:58,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:06:58,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:06:58,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750582556] [2020-04-18 03:06:58,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:06:58,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:06:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:06:58,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:06:58,340 INFO L87 Difference]: Start difference. First operand 3780 states and 12160 transitions. Second operand 12 states. [2020-04-18 03:07:00,166 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-04-18 03:07:00,402 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2020-04-18 03:07:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:00,677 INFO L93 Difference]: Finished difference Result 4354 states and 13762 transitions. [2020-04-18 03:07:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:07:00,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-18 03:07:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:00,685 INFO L225 Difference]: With dead ends: 4354 [2020-04-18 03:07:00,685 INFO L226 Difference]: Without dead ends: 4354 [2020-04-18 03:07:00,686 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:07:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2020-04-18 03:07:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 3406. [2020-04-18 03:07:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3406 states. [2020-04-18 03:07:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 10906 transitions. [2020-04-18 03:07:00,805 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 10906 transitions. Word has length 25 [2020-04-18 03:07:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:00,805 INFO L479 AbstractCegarLoop]: Abstraction has 3406 states and 10906 transitions. [2020-04-18 03:07:00,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:07:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 10906 transitions. [2020-04-18 03:07:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:07:00,808 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:00,808 INFO L425 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] [2020-04-18 03:07:00,808 INFO L427 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash -729745196, now seen corresponding path program 8 times [2020-04-18 03:07:00,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:00,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925306013] [2020-04-18 03:07:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:01,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925306013] [2020-04-18 03:07:01,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:01,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:07:01,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285790361] [2020-04-18 03:07:01,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:07:01,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:07:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:07:01,341 INFO L87 Difference]: Start difference. First operand 3406 states and 10906 transitions. Second operand 13 states. [2020-04-18 03:07:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:02,430 INFO L93 Difference]: Finished difference Result 3434 states and 10992 transitions. [2020-04-18 03:07:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 03:07:02,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:07:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:02,435 INFO L225 Difference]: With dead ends: 3434 [2020-04-18 03:07:02,435 INFO L226 Difference]: Without dead ends: 3434 [2020-04-18 03:07:02,436 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2020-04-18 03:07:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2020-04-18 03:07:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3434. [2020-04-18 03:07:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2020-04-18 03:07:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 10992 transitions. [2020-04-18 03:07:02,482 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 10992 transitions. Word has length 25 [2020-04-18 03:07:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:02,483 INFO L479 AbstractCegarLoop]: Abstraction has 3434 states and 10992 transitions. [2020-04-18 03:07:02,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:07:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 10992 transitions. [2020-04-18 03:07:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:07:02,486 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:02,486 INFO L425 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] [2020-04-18 03:07:02,486 INFO L427 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -787634972, now seen corresponding path program 9 times [2020-04-18 03:07:02,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:02,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973195293] [2020-04-18 03:07:02,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:02,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973195293] [2020-04-18 03:07:02,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:02,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 03:07:02,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969262080] [2020-04-18 03:07:02,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 03:07:02,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 03:07:02,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-18 03:07:02,898 INFO L87 Difference]: Start difference. First operand 3434 states and 10992 transitions. Second operand 13 states. [2020-04-18 03:07:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:05,321 INFO L93 Difference]: Finished difference Result 4144 states and 13132 transitions. [2020-04-18 03:07:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:07:05,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-18 03:07:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:05,327 INFO L225 Difference]: With dead ends: 4144 [2020-04-18 03:07:05,327 INFO L226 Difference]: Without dead ends: 4144 [2020-04-18 03:07:05,328 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:07:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2020-04-18 03:07:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 3266. [2020-04-18 03:07:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2020-04-18 03:07:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 10486 transitions. [2020-04-18 03:07:05,416 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 10486 transitions. Word has length 25 [2020-04-18 03:07:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:05,417 INFO L479 AbstractCegarLoop]: Abstraction has 3266 states and 10486 transitions. [2020-04-18 03:07:05,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 03:07:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 10486 transitions. [2020-04-18 03:07:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 03:07:05,419 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:05,419 INFO L425 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] [2020-04-18 03:07:05,420 INFO L427 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 9690196, now seen corresponding path program 10 times [2020-04-18 03:07:05,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:05,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482802350] [2020-04-18 03:07:05,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:05,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482802350] [2020-04-18 03:07:05,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:05,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 03:07:05,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228607817] [2020-04-18 03:07:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 03:07:05,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 03:07:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-04-18 03:07:05,747 INFO L87 Difference]: Start difference. First operand 3266 states and 10486 transitions. Second operand 12 states. [2020-04-18 03:07:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:08,003 INFO L93 Difference]: Finished difference Result 3990 states and 12613 transitions. [2020-04-18 03:07:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:07:08,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-18 03:07:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:08,010 INFO L225 Difference]: With dead ends: 3990 [2020-04-18 03:07:08,010 INFO L226 Difference]: Without dead ends: 3990 [2020-04-18 03:07:08,010 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2020-04-18 03:07:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2020-04-18 03:07:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3140. [2020-04-18 03:07:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-04-18 03:07:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 10033 transitions. [2020-04-18 03:07:08,055 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 10033 transitions. Word has length 25 [2020-04-18 03:07:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:08,055 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 10033 transitions. [2020-04-18 03:07:08,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 03:07:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 10033 transitions. [2020-04-18 03:07:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:08,058 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:08,059 INFO L425 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] [2020-04-18 03:07:08,059 INFO L427 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:08,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1683232533, now seen corresponding path program 1 times [2020-04-18 03:07:08,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:08,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453762182] [2020-04-18 03:07:08,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:08,768 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2020-04-18 03:07:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:09,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453762182] [2020-04-18 03:07:09,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:09,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:07:09,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460806380] [2020-04-18 03:07:09,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:07:09,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:07:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:07:09,056 INFO L87 Difference]: Start difference. First operand 3140 states and 10033 transitions. Second operand 17 states. [2020-04-18 03:07:10,515 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-04-18 03:07:10,707 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-04-18 03:07:10,961 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-04-18 03:07:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:12,067 INFO L93 Difference]: Finished difference Result 5253 states and 16940 transitions. [2020-04-18 03:07:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:07:12,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:07:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:12,076 INFO L225 Difference]: With dead ends: 5253 [2020-04-18 03:07:12,076 INFO L226 Difference]: Without dead ends: 5253 [2020-04-18 03:07:12,077 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:07:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2020-04-18 03:07:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 3694. [2020-04-18 03:07:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3694 states. [2020-04-18 03:07:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 11920 transitions. [2020-04-18 03:07:12,134 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 11920 transitions. Word has length 27 [2020-04-18 03:07:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:12,134 INFO L479 AbstractCegarLoop]: Abstraction has 3694 states and 11920 transitions. [2020-04-18 03:07:12,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:07:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 11920 transitions. [2020-04-18 03:07:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:12,137 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:12,137 INFO L425 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] [2020-04-18 03:07:12,137 INFO L427 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1683232537, now seen corresponding path program 1 times [2020-04-18 03:07:12,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:12,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004654725] [2020-04-18 03:07:12,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:12,758 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2020-04-18 03:07:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:13,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004654725] [2020-04-18 03:07:13,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:13,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:07:13,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723768397] [2020-04-18 03:07:13,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:07:13,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:13,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:07:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:07:13,019 INFO L87 Difference]: Start difference. First operand 3694 states and 11920 transitions. Second operand 17 states. [2020-04-18 03:07:14,389 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-04-18 03:07:14,581 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-18 03:07:14,797 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-18 03:07:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:16,000 INFO L93 Difference]: Finished difference Result 5160 states and 16593 transitions. [2020-04-18 03:07:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-18 03:07:16,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:07:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:16,008 INFO L225 Difference]: With dead ends: 5160 [2020-04-18 03:07:16,008 INFO L226 Difference]: Without dead ends: 5160 [2020-04-18 03:07:16,009 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2020-04-18 03:07:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2020-04-18 03:07:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 3694. [2020-04-18 03:07:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3694 states. [2020-04-18 03:07:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 11827 transitions. [2020-04-18 03:07:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 11827 transitions. Word has length 27 [2020-04-18 03:07:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:16,061 INFO L479 AbstractCegarLoop]: Abstraction has 3694 states and 11827 transitions. [2020-04-18 03:07:16,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:07:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 11827 transitions. [2020-04-18 03:07:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:16,064 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:16,064 INFO L425 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] [2020-04-18 03:07:16,064 INFO L427 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1341619379, now seen corresponding path program 1 times [2020-04-18 03:07:16,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:16,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928837493] [2020-04-18 03:07:16,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:16,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928837493] [2020-04-18 03:07:16,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:16,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:07:16,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195639736] [2020-04-18 03:07:16,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:07:16,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:07:16,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:07:16,772 INFO L87 Difference]: Start difference. First operand 3694 states and 11827 transitions. Second operand 16 states. [2020-04-18 03:07:18,249 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-04-18 03:07:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:19,239 INFO L93 Difference]: Finished difference Result 4901 states and 15931 transitions. [2020-04-18 03:07:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:07:19,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:07:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:19,247 INFO L225 Difference]: With dead ends: 4901 [2020-04-18 03:07:19,247 INFO L226 Difference]: Without dead ends: 4901 [2020-04-18 03:07:19,248 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:07:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2020-04-18 03:07:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 4261. [2020-04-18 03:07:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2020-04-18 03:07:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 13751 transitions. [2020-04-18 03:07:19,304 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 13751 transitions. Word has length 27 [2020-04-18 03:07:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:19,305 INFO L479 AbstractCegarLoop]: Abstraction has 4261 states and 13751 transitions. [2020-04-18 03:07:19,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:07:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 13751 transitions. [2020-04-18 03:07:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:19,308 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:19,308 INFO L425 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] [2020-04-18 03:07:19,308 INFO L427 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1341619383, now seen corresponding path program 1 times [2020-04-18 03:07:19,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:19,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121524790] [2020-04-18 03:07:19,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:19,882 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 37 [2020-04-18 03:07:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:20,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121524790] [2020-04-18 03:07:20,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:20,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:07:20,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461911447] [2020-04-18 03:07:20,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:07:20,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:07:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:07:20,076 INFO L87 Difference]: Start difference. First operand 4261 states and 13751 transitions. Second operand 16 states. [2020-04-18 03:07:21,657 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-18 03:07:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:22,635 INFO L93 Difference]: Finished difference Result 5330 states and 17233 transitions. [2020-04-18 03:07:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:07:22,635 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:07:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:22,643 INFO L225 Difference]: With dead ends: 5330 [2020-04-18 03:07:22,644 INFO L226 Difference]: Without dead ends: 5330 [2020-04-18 03:07:22,644 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:07:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2020-04-18 03:07:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 3937. [2020-04-18 03:07:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2020-04-18 03:07:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 12581 transitions. [2020-04-18 03:07:22,707 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 12581 transitions. Word has length 27 [2020-04-18 03:07:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:22,707 INFO L479 AbstractCegarLoop]: Abstraction has 3937 states and 12581 transitions. [2020-04-18 03:07:22,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:07:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 12581 transitions. [2020-04-18 03:07:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:22,711 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:22,711 INFO L425 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] [2020-04-18 03:07:22,711 INFO L427 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash -65867347, now seen corresponding path program 2 times [2020-04-18 03:07:22,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:22,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420542348] [2020-04-18 03:07:22,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:23,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420542348] [2020-04-18 03:07:23,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:23,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:07:23,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183990641] [2020-04-18 03:07:23,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:07:23,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:23,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:07:23,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:07:23,491 INFO L87 Difference]: Start difference. First operand 3937 states and 12581 transitions. Second operand 17 states. [2020-04-18 03:07:24,805 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-04-18 03:07:25,012 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2020-04-18 03:07:25,193 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-04-18 03:07:25,411 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-04-18 03:07:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:26,636 INFO L93 Difference]: Finished difference Result 6216 states and 20057 transitions. [2020-04-18 03:07:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:07:26,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:07:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:26,646 INFO L225 Difference]: With dead ends: 6216 [2020-04-18 03:07:26,646 INFO L226 Difference]: Without dead ends: 6216 [2020-04-18 03:07:26,647 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:07:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2020-04-18 03:07:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 4535. [2020-04-18 03:07:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4535 states. [2020-04-18 03:07:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 14600 transitions. [2020-04-18 03:07:26,711 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 14600 transitions. Word has length 27 [2020-04-18 03:07:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:26,711 INFO L479 AbstractCegarLoop]: Abstraction has 4535 states and 14600 transitions. [2020-04-18 03:07:26,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:07:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 14600 transitions. [2020-04-18 03:07:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:26,715 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:26,715 INFO L425 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] [2020-04-18 03:07:26,715 INFO L427 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -65867343, now seen corresponding path program 2 times [2020-04-18 03:07:26,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:26,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206492232] [2020-04-18 03:07:26,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:27,373 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2020-04-18 03:07:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:27,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206492232] [2020-04-18 03:07:27,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:27,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:07:27,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51322575] [2020-04-18 03:07:27,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:07:27,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:27,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:07:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:07:27,585 INFO L87 Difference]: Start difference. First operand 4535 states and 14600 transitions. Second operand 17 states. [2020-04-18 03:07:29,054 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-04-18 03:07:29,240 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-04-18 03:07:29,446 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2020-04-18 03:07:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:30,621 INFO L93 Difference]: Finished difference Result 6645 states and 21359 transitions. [2020-04-18 03:07:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:07:30,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:07:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:30,631 INFO L225 Difference]: With dead ends: 6645 [2020-04-18 03:07:30,631 INFO L226 Difference]: Without dead ends: 6645 [2020-04-18 03:07:30,631 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:07:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2020-04-18 03:07:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 4003. [2020-04-18 03:07:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4003 states. [2020-04-18 03:07:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 12779 transitions. [2020-04-18 03:07:30,695 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 12779 transitions. Word has length 27 [2020-04-18 03:07:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:30,695 INFO L479 AbstractCegarLoop]: Abstraction has 4003 states and 12779 transitions. [2020-04-18 03:07:30,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:07:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 12779 transitions. [2020-04-18 03:07:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:30,698 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:30,698 INFO L425 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] [2020-04-18 03:07:30,698 INFO L427 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 438272035, now seen corresponding path program 3 times [2020-04-18 03:07:30,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:30,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352283910] [2020-04-18 03:07:30,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:31,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352283910] [2020-04-18 03:07:31,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:31,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-18 03:07:31,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592766675] [2020-04-18 03:07:31,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 03:07:31,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 03:07:31,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-04-18 03:07:31,612 INFO L87 Difference]: Start difference. First operand 4003 states and 12779 transitions. Second operand 19 states. [2020-04-18 03:07:33,393 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2020-04-18 03:07:33,741 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2020-04-18 03:07:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:35,141 INFO L93 Difference]: Finished difference Result 6469 states and 20831 transitions. [2020-04-18 03:07:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-18 03:07:35,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-04-18 03:07:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:35,152 INFO L225 Difference]: With dead ends: 6469 [2020-04-18 03:07:35,152 INFO L226 Difference]: Without dead ends: 6469 [2020-04-18 03:07:35,153 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 03:07:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2020-04-18 03:07:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 4201. [2020-04-18 03:07:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2020-04-18 03:07:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 13373 transitions. [2020-04-18 03:07:35,223 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 13373 transitions. Word has length 27 [2020-04-18 03:07:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:35,223 INFO L479 AbstractCegarLoop]: Abstraction has 4201 states and 13373 transitions. [2020-04-18 03:07:35,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 03:07:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 13373 transitions. [2020-04-18 03:07:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:35,226 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:35,226 INFO L425 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] [2020-04-18 03:07:35,227 INFO L427 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2114894005, now seen corresponding path program 4 times [2020-04-18 03:07:35,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:35,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690122228] [2020-04-18 03:07:35,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:35,809 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2020-04-18 03:07:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:36,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690122228] [2020-04-18 03:07:36,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:36,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-18 03:07:36,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657252601] [2020-04-18 03:07:36,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-18 03:07:36,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 03:07:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-04-18 03:07:36,119 INFO L87 Difference]: Start difference. First operand 4201 states and 13373 transitions. Second operand 18 states. [2020-04-18 03:07:38,378 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2020-04-18 03:07:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:39,733 INFO L93 Difference]: Finished difference Result 7524 states and 24441 transitions. [2020-04-18 03:07:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-18 03:07:39,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-18 03:07:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:39,745 INFO L225 Difference]: With dead ends: 7524 [2020-04-18 03:07:39,745 INFO L226 Difference]: Without dead ends: 7524 [2020-04-18 03:07:39,745 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2020-04-18 03:07:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2020-04-18 03:07:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 5222. [2020-04-18 03:07:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2020-04-18 03:07:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 16765 transitions. [2020-04-18 03:07:39,825 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 16765 transitions. Word has length 27 [2020-04-18 03:07:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:39,825 INFO L479 AbstractCegarLoop]: Abstraction has 5222 states and 16765 transitions. [2020-04-18 03:07:39,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-18 03:07:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 16765 transitions. [2020-04-18 03:07:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:39,829 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:39,829 INFO L425 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] [2020-04-18 03:07:39,830 INFO L427 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2114894001, now seen corresponding path program 3 times [2020-04-18 03:07:39,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:39,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981155052] [2020-04-18 03:07:39,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:40,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981155052] [2020-04-18 03:07:40,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:40,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-18 03:07:40,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335557623] [2020-04-18 03:07:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-18 03:07:40,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 03:07:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-04-18 03:07:40,673 INFO L87 Difference]: Start difference. First operand 5222 states and 16765 transitions. Second operand 18 states. [2020-04-18 03:07:41,622 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-04-18 03:07:42,756 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-04-18 03:07:43,122 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2020-04-18 03:07:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:44,779 INFO L93 Difference]: Finished difference Result 7719 states and 24954 transitions. [2020-04-18 03:07:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-04-18 03:07:44,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-18 03:07:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:44,792 INFO L225 Difference]: With dead ends: 7719 [2020-04-18 03:07:44,792 INFO L226 Difference]: Without dead ends: 7719 [2020-04-18 03:07:44,793 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 03:07:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2020-04-18 03:07:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 4693. [2020-04-18 03:07:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4693 states. [2020-04-18 03:07:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4693 states to 4693 states and 14953 transitions. [2020-04-18 03:07:44,872 INFO L78 Accepts]: Start accepts. Automaton has 4693 states and 14953 transitions. Word has length 27 [2020-04-18 03:07:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:44,872 INFO L479 AbstractCegarLoop]: Abstraction has 4693 states and 14953 transitions. [2020-04-18 03:07:44,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-18 03:07:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4693 states and 14953 transitions. [2020-04-18 03:07:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:44,877 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:44,877 INFO L425 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] [2020-04-18 03:07:44,877 INFO L427 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 332696225, now seen corresponding path program 2 times [2020-04-18 03:07:44,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:44,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545346806] [2020-04-18 03:07:44,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:45,432 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2020-04-18 03:07:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:45,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545346806] [2020-04-18 03:07:45,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:45,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:07:45,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271194944] [2020-04-18 03:07:45,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:07:45,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:07:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:07:45,668 INFO L87 Difference]: Start difference. First operand 4693 states and 14953 transitions. Second operand 16 states. [2020-04-18 03:07:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:48,314 INFO L93 Difference]: Finished difference Result 7428 states and 23812 transitions. [2020-04-18 03:07:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:07:48,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:07:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:48,325 INFO L225 Difference]: With dead ends: 7428 [2020-04-18 03:07:48,326 INFO L226 Difference]: Without dead ends: 7428 [2020-04-18 03:07:48,326 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:07:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2020-04-18 03:07:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 4750. [2020-04-18 03:07:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2020-04-18 03:07:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 15124 transitions. [2020-04-18 03:07:48,410 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 15124 transitions. Word has length 27 [2020-04-18 03:07:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:48,411 INFO L479 AbstractCegarLoop]: Abstraction has 4750 states and 15124 transitions. [2020-04-18 03:07:48,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:07:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 15124 transitions. [2020-04-18 03:07:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:48,417 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:48,417 INFO L425 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] [2020-04-18 03:07:48,417 INFO L427 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2092749165, now seen corresponding path program 3 times [2020-04-18 03:07:48,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:48,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780924040] [2020-04-18 03:07:48,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:49,039 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2020-04-18 03:07:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:49,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780924040] [2020-04-18 03:07:49,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:49,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:07:49,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605785999] [2020-04-18 03:07:49,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:07:49,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:07:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:07:49,370 INFO L87 Difference]: Start difference. First operand 4750 states and 15124 transitions. Second operand 17 states. [2020-04-18 03:07:51,139 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2020-04-18 03:07:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:52,183 INFO L93 Difference]: Finished difference Result 7365 states and 23691 transitions. [2020-04-18 03:07:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:07:52,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:07:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:52,195 INFO L225 Difference]: With dead ends: 7365 [2020-04-18 03:07:52,195 INFO L226 Difference]: Without dead ends: 7365 [2020-04-18 03:07:52,196 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2020-04-18 03:07:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2020-04-18 03:07:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 5447. [2020-04-18 03:07:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5447 states. [2020-04-18 03:07:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 5447 states and 17440 transitions. [2020-04-18 03:07:52,284 INFO L78 Accepts]: Start accepts. Automaton has 5447 states and 17440 transitions. Word has length 27 [2020-04-18 03:07:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:52,284 INFO L479 AbstractCegarLoop]: Abstraction has 5447 states and 17440 transitions. [2020-04-18 03:07:52,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:07:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5447 states and 17440 transitions. [2020-04-18 03:07:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:52,290 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:52,290 INFO L425 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] [2020-04-18 03:07:52,290 INFO L427 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2092749169, now seen corresponding path program 2 times [2020-04-18 03:07:52,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:52,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145333229] [2020-04-18 03:07:52,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:52,918 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2020-04-18 03:07:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:53,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145333229] [2020-04-18 03:07:53,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:53,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:07:53,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387201506] [2020-04-18 03:07:53,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:07:53,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:07:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:07:53,208 INFO L87 Difference]: Start difference. First operand 5447 states and 17440 transitions. Second operand 17 states. [2020-04-18 03:07:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:55,924 INFO L93 Difference]: Finished difference Result 7272 states and 23344 transitions. [2020-04-18 03:07:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:07:55,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:07:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:55,935 INFO L225 Difference]: With dead ends: 7272 [2020-04-18 03:07:55,936 INFO L226 Difference]: Without dead ends: 7272 [2020-04-18 03:07:55,936 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2020-04-18 03:07:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2020-04-18 03:07:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 4921. [2020-04-18 03:07:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2020-04-18 03:07:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 15637 transitions. [2020-04-18 03:07:56,016 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 15637 transitions. Word has length 27 [2020-04-18 03:07:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:56,016 INFO L479 AbstractCegarLoop]: Abstraction has 4921 states and 15637 transitions. [2020-04-18 03:07:56,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:07:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 15637 transitions. [2020-04-18 03:07:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:56,021 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:56,021 INFO L425 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] [2020-04-18 03:07:56,022 INFO L427 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -646098017, now seen corresponding path program 4 times [2020-04-18 03:07:56,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:56,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012655332] [2020-04-18 03:07:56,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:56,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012655332] [2020-04-18 03:07:56,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:56,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:56,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782250147] [2020-04-18 03:07:56,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:56,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:56,620 INFO L87 Difference]: Start difference. First operand 4921 states and 15637 transitions. Second operand 15 states. [2020-04-18 03:07:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:07:59,005 INFO L93 Difference]: Finished difference Result 6974 states and 22512 transitions. [2020-04-18 03:07:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 03:07:59,006 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-18 03:07:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:07:59,016 INFO L225 Difference]: With dead ends: 6974 [2020-04-18 03:07:59,017 INFO L226 Difference]: Without dead ends: 6974 [2020-04-18 03:07:59,019 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:07:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2020-04-18 03:07:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 5941. [2020-04-18 03:07:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5941 states. [2020-04-18 03:07:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 19026 transitions. [2020-04-18 03:07:59,110 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 19026 transitions. Word has length 27 [2020-04-18 03:07:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:07:59,110 INFO L479 AbstractCegarLoop]: Abstraction has 5941 states and 19026 transitions. [2020-04-18 03:07:59,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:07:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 19026 transitions. [2020-04-18 03:07:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:07:59,116 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:07:59,116 INFO L425 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] [2020-04-18 03:07:59,116 INFO L427 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:07:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:07:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -646098013, now seen corresponding path program 3 times [2020-04-18 03:07:59,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:07:59,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421398288] [2020-04-18 03:07:59,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:07:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:07:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:07:59,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421398288] [2020-04-18 03:07:59,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:07:59,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-18 03:07:59,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170286600] [2020-04-18 03:07:59,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 03:07:59,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:07:59,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 03:07:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-18 03:07:59,673 INFO L87 Difference]: Start difference. First operand 5941 states and 19026 transitions. Second operand 15 states. [2020-04-18 03:08:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:01,863 INFO L93 Difference]: Finished difference Result 7403 states and 23814 transitions. [2020-04-18 03:08:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 03:08:01,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-18 03:08:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:01,878 INFO L225 Difference]: With dead ends: 7403 [2020-04-18 03:08:01,878 INFO L226 Difference]: Without dead ends: 7403 [2020-04-18 03:08:01,879 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2020-04-18 03:08:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2020-04-18 03:08:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 5114. [2020-04-18 03:08:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5114 states. [2020-04-18 03:08:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 16250 transitions. [2020-04-18 03:08:01,979 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 16250 transitions. Word has length 27 [2020-04-18 03:08:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:01,979 INFO L479 AbstractCegarLoop]: Abstraction has 5114 states and 16250 transitions. [2020-04-18 03:08:01,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 03:08:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 16250 transitions. [2020-04-18 03:08:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:01,984 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:01,984 INFO L425 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] [2020-04-18 03:08:01,984 INFO L427 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1165102133, now seen corresponding path program 5 times [2020-04-18 03:08:01,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:01,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121569760] [2020-04-18 03:08:01,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:02,574 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2020-04-18 03:08:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:02,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121569760] [2020-04-18 03:08:02,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:02,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:02,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118417105] [2020-04-18 03:08:02,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:02,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:02,845 INFO L87 Difference]: Start difference. First operand 5114 states and 16250 transitions. Second operand 17 states. [2020-04-18 03:08:04,589 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-18 03:08:05,022 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-04-18 03:08:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:06,439 INFO L93 Difference]: Finished difference Result 6850 states and 22026 transitions. [2020-04-18 03:08:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:08:06,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:06,451 INFO L225 Difference]: With dead ends: 6850 [2020-04-18 03:08:06,451 INFO L226 Difference]: Without dead ends: 6850 [2020-04-18 03:08:06,451 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:08:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6850 states. [2020-04-18 03:08:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6850 to 5657. [2020-04-18 03:08:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5657 states. [2020-04-18 03:08:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 18104 transitions. [2020-04-18 03:08:06,535 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 18104 transitions. Word has length 27 [2020-04-18 03:08:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:06,535 INFO L479 AbstractCegarLoop]: Abstraction has 5657 states and 18104 transitions. [2020-04-18 03:08:06,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 18104 transitions. [2020-04-18 03:08:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:06,540 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:06,541 INFO L425 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] [2020-04-18 03:08:06,541 INFO L427 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1165102137, now seen corresponding path program 4 times [2020-04-18 03:08:06,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:06,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196957901] [2020-04-18 03:08:06,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:07,158 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2020-04-18 03:08:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:07,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196957901] [2020-04-18 03:08:07,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:07,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:07,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10840896] [2020-04-18 03:08:07,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:07,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:07,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:07,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:07,376 INFO L87 Difference]: Start difference. First operand 5657 states and 18104 transitions. Second operand 17 states. [2020-04-18 03:08:08,822 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2020-04-18 03:08:09,008 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-04-18 03:08:09,213 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-04-18 03:08:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:10,524 INFO L93 Difference]: Finished difference Result 6757 states and 21679 transitions. [2020-04-18 03:08:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-18 03:08:10,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:10,534 INFO L225 Difference]: With dead ends: 6757 [2020-04-18 03:08:10,535 INFO L226 Difference]: Without dead ends: 6757 [2020-04-18 03:08:10,535 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2020-04-18 03:08:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2020-04-18 03:08:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5163. [2020-04-18 03:08:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5163 states. [2020-04-18 03:08:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 16397 transitions. [2020-04-18 03:08:10,607 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 16397 transitions. Word has length 27 [2020-04-18 03:08:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:10,607 INFO L479 AbstractCegarLoop]: Abstraction has 5163 states and 16397 transitions. [2020-04-18 03:08:10,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 16397 transitions. [2020-04-18 03:08:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:10,613 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:10,613 INFO L425 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] [2020-04-18 03:08:10,613 INFO L427 AbstractCegarLoop]: === Iteration 50 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:10,613 INFO L82 PathProgramCache]: Analyzing trace with hash -583997747, now seen corresponding path program 6 times [2020-04-18 03:08:10,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:10,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903037624] [2020-04-18 03:08:10,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:11,122 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2020-04-18 03:08:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:11,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903037624] [2020-04-18 03:08:11,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:11,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:11,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665126497] [2020-04-18 03:08:11,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:11,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:11,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:11,366 INFO L87 Difference]: Start difference. First operand 5163 states and 16397 transitions. Second operand 17 states. [2020-04-18 03:08:13,307 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2020-04-18 03:08:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:14,470 INFO L93 Difference]: Finished difference Result 7679 states and 24584 transitions. [2020-04-18 03:08:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:08:14,471 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:14,482 INFO L225 Difference]: With dead ends: 7679 [2020-04-18 03:08:14,482 INFO L226 Difference]: Without dead ends: 7679 [2020-04-18 03:08:14,482 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:08:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7679 states. [2020-04-18 03:08:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7679 to 5794. [2020-04-18 03:08:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5794 states. [2020-04-18 03:08:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5794 states to 5794 states and 18515 transitions. [2020-04-18 03:08:14,563 INFO L78 Accepts]: Start accepts. Automaton has 5794 states and 18515 transitions. Word has length 27 [2020-04-18 03:08:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:14,564 INFO L479 AbstractCegarLoop]: Abstraction has 5794 states and 18515 transitions. [2020-04-18 03:08:14,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5794 states and 18515 transitions. [2020-04-18 03:08:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:14,568 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:14,568 INFO L425 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] [2020-04-18 03:08:14,568 INFO L427 AbstractCegarLoop]: === Iteration 51 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash -583997743, now seen corresponding path program 5 times [2020-04-18 03:08:14,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:14,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932058510] [2020-04-18 03:08:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:15,101 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2020-04-18 03:08:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:15,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932058510] [2020-04-18 03:08:15,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:15,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:15,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146806857] [2020-04-18 03:08:15,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:15,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:15,393 INFO L87 Difference]: Start difference. First operand 5794 states and 18515 transitions. Second operand 17 states. [2020-04-18 03:08:16,816 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2020-04-18 03:08:17,197 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2020-04-18 03:08:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:18,247 INFO L93 Difference]: Finished difference Result 8108 states and 25886 transitions. [2020-04-18 03:08:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:08:18,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:18,260 INFO L225 Difference]: With dead ends: 8108 [2020-04-18 03:08:18,260 INFO L226 Difference]: Without dead ends: 8108 [2020-04-18 03:08:18,260 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:08:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2020-04-18 03:08:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 5262. [2020-04-18 03:08:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2020-04-18 03:08:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 16694 transitions. [2020-04-18 03:08:18,343 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 16694 transitions. Word has length 27 [2020-04-18 03:08:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:18,343 INFO L479 AbstractCegarLoop]: Abstraction has 5262 states and 16694 transitions. [2020-04-18 03:08:18,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 16694 transitions. [2020-04-18 03:08:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:18,348 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:18,348 INFO L425 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] [2020-04-18 03:08:18,348 INFO L427 AbstractCegarLoop]: === Iteration 52 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:18,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:18,348 INFO L82 PathProgramCache]: Analyzing trace with hash -79858365, now seen corresponding path program 7 times [2020-04-18 03:08:18,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:18,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073875211] [2020-04-18 03:08:18,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:18,934 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2020-04-18 03:08:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:19,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073875211] [2020-04-18 03:08:19,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:19,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-18 03:08:19,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634321084] [2020-04-18 03:08:19,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 03:08:19,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 03:08:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2020-04-18 03:08:19,257 INFO L87 Difference]: Start difference. First operand 5262 states and 16694 transitions. Second operand 19 states. [2020-04-18 03:08:21,215 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-04-18 03:08:21,415 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2020-04-18 03:08:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:22,460 INFO L93 Difference]: Finished difference Result 8025 states and 25705 transitions. [2020-04-18 03:08:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-18 03:08:22,461 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-04-18 03:08:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:22,473 INFO L225 Difference]: With dead ends: 8025 [2020-04-18 03:08:22,473 INFO L226 Difference]: Without dead ends: 8025 [2020-04-18 03:08:22,473 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2020-04-18 03:08:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8025 states. [2020-04-18 03:08:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8025 to 6069. [2020-04-18 03:08:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6069 states. [2020-04-18 03:08:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 19340 transitions. [2020-04-18 03:08:22,562 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 19340 transitions. Word has length 27 [2020-04-18 03:08:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:22,562 INFO L479 AbstractCegarLoop]: Abstraction has 6069 states and 19340 transitions. [2020-04-18 03:08:22,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 03:08:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 19340 transitions. [2020-04-18 03:08:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:22,567 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:22,567 INFO L425 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] [2020-04-18 03:08:22,567 INFO L427 AbstractCegarLoop]: === Iteration 53 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -79858361, now seen corresponding path program 6 times [2020-04-18 03:08:22,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:22,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174198594] [2020-04-18 03:08:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:23,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174198594] [2020-04-18 03:08:23,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:23,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:08:23,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064327385] [2020-04-18 03:08:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:08:23,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:08:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:08:23,332 INFO L87 Difference]: Start difference. First operand 6069 states and 19340 transitions. Second operand 16 states. [2020-04-18 03:08:24,738 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2020-04-18 03:08:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:26,234 INFO L93 Difference]: Finished difference Result 8865 states and 28560 transitions. [2020-04-18 03:08:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:08:26,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:08:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:26,247 INFO L225 Difference]: With dead ends: 8865 [2020-04-18 03:08:26,247 INFO L226 Difference]: Without dead ends: 8865 [2020-04-18 03:08:26,247 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:08:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8865 states. [2020-04-18 03:08:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8865 to 6619. [2020-04-18 03:08:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6619 states. [2020-04-18 03:08:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6619 states to 6619 states and 21094 transitions. [2020-04-18 03:08:26,344 INFO L78 Accepts]: Start accepts. Automaton has 6619 states and 21094 transitions. Word has length 27 [2020-04-18 03:08:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:26,345 INFO L479 AbstractCegarLoop]: Abstraction has 6619 states and 21094 transitions. [2020-04-18 03:08:26,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:08:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6619 states and 21094 transitions. [2020-04-18 03:08:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:26,350 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:26,350 INFO L425 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] [2020-04-18 03:08:26,351 INFO L427 AbstractCegarLoop]: === Iteration 54 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1661942891, now seen corresponding path program 8 times [2020-04-18 03:08:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:26,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308460820] [2020-04-18 03:08:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:27,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308460820] [2020-04-18 03:08:27,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:27,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:08:27,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734311282] [2020-04-18 03:08:27,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:08:27,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:08:27,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:08:27,095 INFO L87 Difference]: Start difference. First operand 6619 states and 21094 transitions. Second operand 16 states. [2020-04-18 03:08:28,722 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2020-04-18 03:08:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:30,400 INFO L93 Difference]: Finished difference Result 7822 states and 24972 transitions. [2020-04-18 03:08:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:08:30,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:08:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:30,412 INFO L225 Difference]: With dead ends: 7822 [2020-04-18 03:08:30,412 INFO L226 Difference]: Without dead ends: 7822 [2020-04-18 03:08:30,413 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:08:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7822 states. [2020-04-18 03:08:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7822 to 5304. [2020-04-18 03:08:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2020-04-18 03:08:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 16820 transitions. [2020-04-18 03:08:30,492 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 16820 transitions. Word has length 27 [2020-04-18 03:08:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:30,492 INFO L479 AbstractCegarLoop]: Abstraction has 5304 states and 16820 transitions. [2020-04-18 03:08:30,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:08:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 16820 transitions. [2020-04-18 03:08:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:30,497 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:30,497 INFO L425 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] [2020-04-18 03:08:30,498 INFO L427 AbstractCegarLoop]: === Iteration 55 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1834625615, now seen corresponding path program 9 times [2020-04-18 03:08:30,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:30,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636840126] [2020-04-18 03:08:30,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:31,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636840126] [2020-04-18 03:08:31,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:31,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:31,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493443678] [2020-04-18 03:08:31,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:31,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:31,259 INFO L87 Difference]: Start difference. First operand 5304 states and 16820 transitions. Second operand 17 states. [2020-04-18 03:08:32,932 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-04-18 03:08:33,149 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-18 03:08:33,352 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-04-18 03:08:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:34,558 INFO L93 Difference]: Finished difference Result 6358 states and 20467 transitions. [2020-04-18 03:08:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:08:34,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:34,568 INFO L225 Difference]: With dead ends: 6358 [2020-04-18 03:08:34,568 INFO L226 Difference]: Without dead ends: 6358 [2020-04-18 03:08:34,568 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:08:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2020-04-18 03:08:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 5709. [2020-04-18 03:08:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2020-04-18 03:08:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 18260 transitions. [2020-04-18 03:08:34,642 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 18260 transitions. Word has length 27 [2020-04-18 03:08:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:34,642 INFO L479 AbstractCegarLoop]: Abstraction has 5709 states and 18260 transitions. [2020-04-18 03:08:34,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 18260 transitions. [2020-04-18 03:08:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:34,646 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:34,647 INFO L425 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] [2020-04-18 03:08:34,647 INFO L427 AbstractCegarLoop]: === Iteration 56 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1834625619, now seen corresponding path program 7 times [2020-04-18 03:08:34,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:34,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112151320] [2020-04-18 03:08:34,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:35,169 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2020-04-18 03:08:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:35,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112151320] [2020-04-18 03:08:35,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:35,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:35,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481207856] [2020-04-18 03:08:35,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:35,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:35,413 INFO L87 Difference]: Start difference. First operand 5709 states and 18260 transitions. Second operand 17 states. [2020-04-18 03:08:36,986 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-04-18 03:08:37,170 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-18 03:08:37,383 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-04-18 03:08:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:38,744 INFO L93 Difference]: Finished difference Result 6787 states and 21769 transitions. [2020-04-18 03:08:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:08:38,744 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:38,754 INFO L225 Difference]: With dead ends: 6787 [2020-04-18 03:08:38,755 INFO L226 Difference]: Without dead ends: 6787 [2020-04-18 03:08:38,755 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:08:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2020-04-18 03:08:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 5177. [2020-04-18 03:08:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2020-04-18 03:08:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 16439 transitions. [2020-04-18 03:08:38,837 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 16439 transitions. Word has length 27 [2020-04-18 03:08:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:38,837 INFO L479 AbstractCegarLoop]: Abstraction has 5177 states and 16439 transitions. [2020-04-18 03:08:38,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 16439 transitions. [2020-04-18 03:08:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:38,841 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:38,842 INFO L425 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] [2020-04-18 03:08:38,842 INFO L427 AbstractCegarLoop]: === Iteration 57 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1956202299, now seen corresponding path program 10 times [2020-04-18 03:08:38,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:38,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824843656] [2020-04-18 03:08:38,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:39,532 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2020-04-18 03:08:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:39,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824843656] [2020-04-18 03:08:39,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:39,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-18 03:08:39,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175270964] [2020-04-18 03:08:39,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 03:08:39,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:39,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 03:08:39,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2020-04-18 03:08:39,878 INFO L87 Difference]: Start difference. First operand 5177 states and 16439 transitions. Second operand 19 states. [2020-04-18 03:08:41,544 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-04-18 03:08:41,749 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-18 03:08:41,937 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-18 03:08:42,142 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2020-04-18 03:08:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:43,306 INFO L93 Difference]: Finished difference Result 7978 states and 25564 transitions. [2020-04-18 03:08:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-18 03:08:43,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-04-18 03:08:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:43,320 INFO L225 Difference]: With dead ends: 7978 [2020-04-18 03:08:43,320 INFO L226 Difference]: Without dead ends: 7978 [2020-04-18 03:08:43,321 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2020-04-18 03:08:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2020-04-18 03:08:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 5984. [2020-04-18 03:08:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5984 states. [2020-04-18 03:08:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5984 states to 5984 states and 19085 transitions. [2020-04-18 03:08:43,417 INFO L78 Accepts]: Start accepts. Automaton has 5984 states and 19085 transitions. Word has length 27 [2020-04-18 03:08:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:43,417 INFO L479 AbstractCegarLoop]: Abstraction has 5984 states and 19085 transitions. [2020-04-18 03:08:43,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 03:08:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5984 states and 19085 transitions. [2020-04-18 03:08:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:43,422 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:43,422 INFO L425 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] [2020-04-18 03:08:43,422 INFO L427 AbstractCegarLoop]: === Iteration 58 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1956202295, now seen corresponding path program 8 times [2020-04-18 03:08:43,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:43,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779686408] [2020-04-18 03:08:43,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:43,901 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2020-04-18 03:08:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:44,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779686408] [2020-04-18 03:08:44,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:44,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:08:44,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418670296] [2020-04-18 03:08:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:08:44,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:08:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:08:44,158 INFO L87 Difference]: Start difference. First operand 5984 states and 19085 transitions. Second operand 16 states. [2020-04-18 03:08:45,736 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2020-04-18 03:08:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:47,533 INFO L93 Difference]: Finished difference Result 8818 states and 28419 transitions. [2020-04-18 03:08:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:08:47,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:08:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:47,547 INFO L225 Difference]: With dead ends: 8818 [2020-04-18 03:08:47,547 INFO L226 Difference]: Without dead ends: 8818 [2020-04-18 03:08:47,548 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:08:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8818 states. [2020-04-18 03:08:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8818 to 6534. [2020-04-18 03:08:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6534 states. [2020-04-18 03:08:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 20839 transitions. [2020-04-18 03:08:47,652 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 20839 transitions. Word has length 27 [2020-04-18 03:08:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:47,652 INFO L479 AbstractCegarLoop]: Abstraction has 6534 states and 20839 transitions. [2020-04-18 03:08:47,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:08:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 20839 transitions. [2020-04-18 03:08:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:47,658 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:47,658 INFO L425 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] [2020-04-18 03:08:47,658 INFO L427 AbstractCegarLoop]: === Iteration 59 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash -214401043, now seen corresponding path program 11 times [2020-04-18 03:08:47,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:47,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412639473] [2020-04-18 03:08:47,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:48,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412639473] [2020-04-18 03:08:48,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:48,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:08:48,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877307462] [2020-04-18 03:08:48,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:08:48,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:08:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:08:48,395 INFO L87 Difference]: Start difference. First operand 6534 states and 20839 transitions. Second operand 16 states. [2020-04-18 03:08:49,931 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2020-04-18 03:08:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:51,602 INFO L93 Difference]: Finished difference Result 7775 states and 24831 transitions. [2020-04-18 03:08:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:08:51,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:08:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:51,615 INFO L225 Difference]: With dead ends: 7775 [2020-04-18 03:08:51,616 INFO L226 Difference]: Without dead ends: 7775 [2020-04-18 03:08:51,616 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:08:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2020-04-18 03:08:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 5078. [2020-04-18 03:08:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5078 states. [2020-04-18 03:08:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 16142 transitions. [2020-04-18 03:08:51,693 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 16142 transitions. Word has length 27 [2020-04-18 03:08:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:51,693 INFO L479 AbstractCegarLoop]: Abstraction has 5078 states and 16142 transitions. [2020-04-18 03:08:51,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:08:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 16142 transitions. [2020-04-18 03:08:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:51,697 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:51,697 INFO L425 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] [2020-04-18 03:08:51,698 INFO L427 AbstractCegarLoop]: === Iteration 60 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:51,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1338767537, now seen corresponding path program 12 times [2020-04-18 03:08:51,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:51,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577083885] [2020-04-18 03:08:51,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:52,121 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2020-04-18 03:08:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:52,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577083885] [2020-04-18 03:08:52,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:52,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:08:52,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842948376] [2020-04-18 03:08:52,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:08:52,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:52,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:08:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:08:52,500 INFO L87 Difference]: Start difference. First operand 5078 states and 16142 transitions. Second operand 17 states. [2020-04-18 03:08:53,997 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-04-18 03:08:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:08:55,478 INFO L93 Difference]: Finished difference Result 6743 states and 21726 transitions. [2020-04-18 03:08:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:08:55,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:08:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:08:55,489 INFO L225 Difference]: With dead ends: 6743 [2020-04-18 03:08:55,489 INFO L226 Difference]: Without dead ends: 6743 [2020-04-18 03:08:55,490 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:08:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2020-04-18 03:08:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 6138. [2020-04-18 03:08:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2020-04-18 03:08:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 19651 transitions. [2020-04-18 03:08:55,576 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 19651 transitions. Word has length 27 [2020-04-18 03:08:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:08:55,576 INFO L479 AbstractCegarLoop]: Abstraction has 6138 states and 19651 transitions. [2020-04-18 03:08:55,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:08:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 19651 transitions. [2020-04-18 03:08:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:08:55,581 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:08:55,581 INFO L425 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] [2020-04-18 03:08:55,581 INFO L427 AbstractCegarLoop]: === Iteration 61 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:08:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:08:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1338767533, now seen corresponding path program 9 times [2020-04-18 03:08:55,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:08:55,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587176394] [2020-04-18 03:08:55,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:08:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:08:56,224 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2020-04-18 03:08:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:08:56,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587176394] [2020-04-18 03:08:56,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:08:56,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-18 03:08:56,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220378778] [2020-04-18 03:08:56,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 03:08:56,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:08:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 03:08:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-04-18 03:08:56,514 INFO L87 Difference]: Start difference. First operand 6138 states and 19651 transitions. Second operand 19 states. [2020-04-18 03:08:58,155 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-04-18 03:08:58,457 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-04-18 03:08:58,681 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-04-18 03:08:58,884 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-04-18 03:09:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:00,323 INFO L93 Difference]: Finished difference Result 7759 states and 25014 transitions. [2020-04-18 03:09:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-18 03:09:00,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-04-18 03:09:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:00,336 INFO L225 Difference]: With dead ends: 7759 [2020-04-18 03:09:00,336 INFO L226 Difference]: Without dead ends: 7759 [2020-04-18 03:09:00,336 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 03:09:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7759 states. [2020-04-18 03:09:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7759 to 6237. [2020-04-18 03:09:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6237 states. [2020-04-18 03:09:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6237 states to 6237 states and 19948 transitions. [2020-04-18 03:09:00,425 INFO L78 Accepts]: Start accepts. Automaton has 6237 states and 19948 transitions. Word has length 27 [2020-04-18 03:09:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:00,426 INFO L479 AbstractCegarLoop]: Abstraction has 6237 states and 19948 transitions. [2020-04-18 03:09:00,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 03:09:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6237 states and 19948 transitions. [2020-04-18 03:09:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:00,431 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:00,431 INFO L425 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] [2020-04-18 03:09:00,431 INFO L427 AbstractCegarLoop]: === Iteration 62 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash -651671225, now seen corresponding path program 10 times [2020-04-18 03:09:00,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:00,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228442977] [2020-04-18 03:09:00,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:01,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228442977] [2020-04-18 03:09:01,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:09:01,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086121396] [2020-04-18 03:09:01,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:09:01,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:09:01,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:09:01,252 INFO L87 Difference]: Start difference. First operand 6237 states and 19948 transitions. Second operand 17 states. [2020-04-18 03:09:02,930 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-18 03:09:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:04,770 INFO L93 Difference]: Finished difference Result 7863 states and 25255 transitions. [2020-04-18 03:09:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:09:04,771 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:09:04,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:04,783 INFO L225 Difference]: With dead ends: 7863 [2020-04-18 03:09:04,783 INFO L226 Difference]: Without dead ends: 7863 [2020-04-18 03:09:04,784 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:09:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2020-04-18 03:09:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 4748. [2020-04-18 03:09:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2020-04-18 03:09:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 15152 transitions. [2020-04-18 03:09:04,873 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 15152 transitions. Word has length 27 [2020-04-18 03:09:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:04,873 INFO L479 AbstractCegarLoop]: Abstraction has 4748 states and 15152 transitions. [2020-04-18 03:09:04,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:09:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 15152 transitions. [2020-04-18 03:09:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:04,877 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:04,878 INFO L425 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] [2020-04-18 03:09:04,878 INFO L427 AbstractCegarLoop]: === Iteration 63 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2060419983, now seen corresponding path program 13 times [2020-04-18 03:09:04,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:04,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983847115] [2020-04-18 03:09:04,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:05,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983847115] [2020-04-18 03:09:05,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:05,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:09:05,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945864357] [2020-04-18 03:09:05,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:09:05,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:05,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:09:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:09:05,705 INFO L87 Difference]: Start difference. First operand 4748 states and 15152 transitions. Second operand 16 states. [2020-04-18 03:09:07,078 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-18 03:09:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:08,716 INFO L93 Difference]: Finished difference Result 6303 states and 20406 transitions. [2020-04-18 03:09:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:09:08,716 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:09:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:08,725 INFO L225 Difference]: With dead ends: 6303 [2020-04-18 03:09:08,725 INFO L226 Difference]: Without dead ends: 6303 [2020-04-18 03:09:08,726 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:09:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6303 states. [2020-04-18 03:09:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6303 to 5698. [2020-04-18 03:09:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2020-04-18 03:09:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 18331 transitions. [2020-04-18 03:09:08,799 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 18331 transitions. Word has length 27 [2020-04-18 03:09:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:08,799 INFO L479 AbstractCegarLoop]: Abstraction has 5698 states and 18331 transitions. [2020-04-18 03:09:08,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:09:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 18331 transitions. [2020-04-18 03:09:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:08,804 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:08,805 INFO L425 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] [2020-04-18 03:09:08,805 INFO L427 AbstractCegarLoop]: === Iteration 64 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2060419987, now seen corresponding path program 11 times [2020-04-18 03:09:08,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:08,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203292546] [2020-04-18 03:09:08,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:09,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203292546] [2020-04-18 03:09:09,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:09,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:09:09,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715017772] [2020-04-18 03:09:09,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:09:09,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:09:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:09:09,623 INFO L87 Difference]: Start difference. First operand 5698 states and 18331 transitions. Second operand 16 states. [2020-04-18 03:09:11,015 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2020-04-18 03:09:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:12,677 INFO L93 Difference]: Finished difference Result 6732 states and 21708 transitions. [2020-04-18 03:09:12,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 03:09:12,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:09:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:12,688 INFO L225 Difference]: With dead ends: 6732 [2020-04-18 03:09:12,688 INFO L226 Difference]: Without dead ends: 6732 [2020-04-18 03:09:12,688 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2020-04-18 03:09:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2020-04-18 03:09:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 4638. [2020-04-18 03:09:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4638 states. [2020-04-18 03:09:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 14822 transitions. [2020-04-18 03:09:12,759 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 14822 transitions. Word has length 27 [2020-04-18 03:09:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:12,759 INFO L479 AbstractCegarLoop]: Abstraction has 4638 states and 14822 transitions. [2020-04-18 03:09:12,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:09:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 14822 transitions. [2020-04-18 03:09:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:12,764 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:12,764 INFO L425 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] [2020-04-18 03:09:12,764 INFO L427 AbstractCegarLoop]: === Iteration 65 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1906370165, now seen corresponding path program 14 times [2020-04-18 03:09:12,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:12,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377887598] [2020-04-18 03:09:12,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:13,428 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2020-04-18 03:09:13,560 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2020-04-18 03:09:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:13,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377887598] [2020-04-18 03:09:13,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:13,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-18 03:09:13,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346558125] [2020-04-18 03:09:13,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-18 03:09:13,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 03:09:13,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-04-18 03:09:13,682 INFO L87 Difference]: Start difference. First operand 4638 states and 14822 transitions. Second operand 18 states. [2020-04-18 03:09:14,789 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-04-18 03:09:15,861 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-04-18 03:09:16,045 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-04-18 03:09:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:17,511 INFO L93 Difference]: Finished difference Result 6277 states and 20371 transitions. [2020-04-18 03:09:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-18 03:09:17,512 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-18 03:09:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:17,521 INFO L225 Difference]: With dead ends: 6277 [2020-04-18 03:09:17,522 INFO L226 Difference]: Without dead ends: 6277 [2020-04-18 03:09:17,522 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2020-04-18 03:09:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2020-04-18 03:09:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 5448. [2020-04-18 03:09:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5448 states. [2020-04-18 03:09:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5448 states to 5448 states and 17561 transitions. [2020-04-18 03:09:17,594 INFO L78 Accepts]: Start accepts. Automaton has 5448 states and 17561 transitions. Word has length 27 [2020-04-18 03:09:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:17,594 INFO L479 AbstractCegarLoop]: Abstraction has 5448 states and 17561 transitions. [2020-04-18 03:09:17,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-18 03:09:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5448 states and 17561 transitions. [2020-04-18 03:09:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:17,600 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:17,600 INFO L425 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] [2020-04-18 03:09:17,600 INFO L427 AbstractCegarLoop]: === Iteration 66 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:17,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:17,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1906370169, now seen corresponding path program 12 times [2020-04-18 03:09:17,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:17,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422155791] [2020-04-18 03:09:17,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:18,185 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2020-04-18 03:09:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:18,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422155791] [2020-04-18 03:09:18,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:18,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-18 03:09:18,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527049218] [2020-04-18 03:09:18,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 03:09:18,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 03:09:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-04-18 03:09:18,489 INFO L87 Difference]: Start difference. First operand 5448 states and 17561 transitions. Second operand 17 states. [2020-04-18 03:09:20,369 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2020-04-18 03:09:20,543 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-04-18 03:09:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:21,644 INFO L93 Difference]: Finished difference Result 6562 states and 21193 transitions. [2020-04-18 03:09:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-18 03:09:21,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-18 03:09:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:21,656 INFO L225 Difference]: With dead ends: 6562 [2020-04-18 03:09:21,656 INFO L226 Difference]: Without dead ends: 6562 [2020-04-18 03:09:21,656 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2020-04-18 03:09:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2020-04-18 03:09:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 4498. [2020-04-18 03:09:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2020-04-18 03:09:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 14382 transitions. [2020-04-18 03:09:21,732 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 14382 transitions. Word has length 27 [2020-04-18 03:09:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:21,733 INFO L479 AbstractCegarLoop]: Abstraction has 4498 states and 14382 transitions. [2020-04-18 03:09:21,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 03:09:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 14382 transitions. [2020-04-18 03:09:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:21,737 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:21,737 INFO L425 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] [2020-04-18 03:09:21,737 INFO L427 AbstractCegarLoop]: === Iteration 67 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1627488203, now seen corresponding path program 15 times [2020-04-18 03:09:21,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:21,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395940547] [2020-04-18 03:09:21,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:22,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395940547] [2020-04-18 03:09:22,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:22,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:09:22,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380687766] [2020-04-18 03:09:22,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:09:22,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:09:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:09:22,314 INFO L87 Difference]: Start difference. First operand 4498 states and 14382 transitions. Second operand 16 states. [2020-04-18 03:09:23,886 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2020-04-18 03:09:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:26,041 INFO L93 Difference]: Finished difference Result 7591 states and 24668 transitions. [2020-04-18 03:09:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-18 03:09:26,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:09:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:26,053 INFO L225 Difference]: With dead ends: 7591 [2020-04-18 03:09:26,053 INFO L226 Difference]: Without dead ends: 7591 [2020-04-18 03:09:26,054 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:09:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2020-04-18 03:09:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 5360. [2020-04-18 03:09:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5360 states. [2020-04-18 03:09:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 17288 transitions. [2020-04-18 03:09:26,130 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 17288 transitions. Word has length 27 [2020-04-18 03:09:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:26,130 INFO L479 AbstractCegarLoop]: Abstraction has 5360 states and 17288 transitions. [2020-04-18 03:09:26,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:09:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 17288 transitions. [2020-04-18 03:09:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:26,134 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:26,135 INFO L425 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] [2020-04-18 03:09:26,135 INFO L427 AbstractCegarLoop]: === Iteration 68 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1627488199, now seen corresponding path program 13 times [2020-04-18 03:09:26,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:26,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176732733] [2020-04-18 03:09:26,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:26,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176732733] [2020-04-18 03:09:26,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:26,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:09:26,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508587976] [2020-04-18 03:09:26,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:09:26,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:26,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:09:26,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:09:26,801 INFO L87 Difference]: Start difference. First operand 5360 states and 17288 transitions. Second operand 16 states. [2020-04-18 03:09:28,378 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2020-04-18 03:09:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 03:09:30,483 INFO L93 Difference]: Finished difference Result 8020 states and 25970 transitions. [2020-04-18 03:09:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-18 03:09:30,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-18 03:09:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 03:09:30,499 INFO L225 Difference]: With dead ends: 8020 [2020-04-18 03:09:30,499 INFO L226 Difference]: Without dead ends: 8020 [2020-04-18 03:09:30,499 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-18 03:09:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8020 states. [2020-04-18 03:09:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8020 to 4550. [2020-04-18 03:09:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2020-04-18 03:09:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 14549 transitions. [2020-04-18 03:09:30,583 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 14549 transitions. Word has length 27 [2020-04-18 03:09:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 03:09:30,583 INFO L479 AbstractCegarLoop]: Abstraction has 4550 states and 14549 transitions. [2020-04-18 03:09:30,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-18 03:09:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 14549 transitions. [2020-04-18 03:09:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 03:09:30,587 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 03:09:30,587 INFO L425 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] [2020-04-18 03:09:30,587 INFO L427 AbstractCegarLoop]: === Iteration 69 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 03:09:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 03:09:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1724332627, now seen corresponding path program 5 times [2020-04-18 03:09:30,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 03:09:30,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225162592] [2020-04-18 03:09:30,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 03:09:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 03:09:31,119 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 33 [2020-04-18 03:09:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 03:09:31,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225162592] [2020-04-18 03:09:31,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 03:09:31,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-18 03:09:31,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222399570] [2020-04-18 03:09:31,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-18 03:09:31,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-18 03:09:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 03:09:31,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-18 03:09:31,379 INFO L87 Difference]: Start difference. First operand 4550 states and 14549 transitions. Second operand 16 states. [2020-04-18 03:09:32,965 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 Received shutdown request... [2020-04-18 03:09:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 03:09:33,007 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 03:09:33,011 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 03:09:33,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:09:33 BasicIcfg [2020-04-18 03:09:33,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 03:09:33,013 INFO L168 Benchmark]: Toolchain (without parser) took 239684.41 ms. Allocated memory was 147.3 MB in the beginning and 1.1 GB in the end (delta: 966.3 MB). Free memory was 103.1 MB in the beginning and 956.6 MB in the end (delta: -853.4 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,014 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1096.89 ms. Allocated memory was 147.3 MB in the beginning and 201.9 MB in the end (delta: 54.5 MB). Free memory was 101.2 MB in the beginning and 122.4 MB in the end (delta: -21.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.52 ms. Allocated memory is still 201.9 MB. Free memory was 122.4 MB in the beginning and 119.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,015 INFO L168 Benchmark]: Boogie Preprocessor took 81.45 ms. Allocated memory is still 201.9 MB. Free memory was 119.1 MB in the beginning and 116.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,015 INFO L168 Benchmark]: RCFGBuilder took 761.29 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 116.4 MB in the beginning and 185.2 MB in the end (delta: -68.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,016 INFO L168 Benchmark]: TraceAbstraction took 237584.67 ms. Allocated memory was 232.8 MB in the beginning and 1.1 GB in the end (delta: 880.8 MB). Free memory was 183.9 MB in the beginning and 956.6 MB in the end (delta: -772.7 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. [2020-04-18 03:09:33,018 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1096.89 ms. Allocated memory was 147.3 MB in the beginning and 201.9 MB in the end (delta: 54.5 MB). Free memory was 101.2 MB in the beginning and 122.4 MB in the end (delta: -21.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.52 ms. Allocated memory is still 201.9 MB. Free memory was 122.4 MB in the beginning and 119.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.45 ms. Allocated memory is still 201.9 MB. Free memory was 119.1 MB in the beginning and 116.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.29 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 116.4 MB in the beginning and 185.2 MB in the end (delta: -68.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237584.67 ms. Allocated memory was 232.8 MB in the beginning and 1.1 GB in the end (delta: 880.8 MB). Free memory was 183.9 MB in the beginning and 956.6 MB in the end (delta: -772.7 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 189 ProgramPointsBefore, 60 ProgramPointsAfterwards, 201 TransitionsBefore, 65 TransitionsAfterwards, 16584 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 7 ChoiceCompositions, 8495 VarBasedMoverChecksPositive, 86 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 27552 CheckedPairsTotal, 160 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 (4550states) and FLOYD_HOARE automaton (currently 11 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (1578 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 (4550states) and FLOYD_HOARE automaton (currently 11 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (1578 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 (4550states) and FLOYD_HOARE automaton (currently 11 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (1578 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 (4550states) and FLOYD_HOARE automaton (currently 11 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (1578 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 237.3s, OverallIterations: 69, TraceHistogramMax: 1, AutomataDifference: 181.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 4454 SDtfs, 17805 SDslu, 20619 SDs, 0 SdLazy, 101301 SolverSat, 1525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1771 GetRequests, 48 SyntacticMatches, 41 SemanticMatches, 1682 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5738 ImplicationChecksByTransitivity, 100.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6619occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 68 MinimizatonAttempts, 80772 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 43.5s InterpolantComputationTime, 1775 NumberOfCodeBlocks, 1775 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 1186256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 69 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown