/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-17 22:49:41,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-17 22:49:41,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-17 22:49:41,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-17 22:49:41,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-17 22:49:41,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-17 22:49:41,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-17 22:49:41,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-17 22:49:41,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-17 22:49:41,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-17 22:49:41,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-17 22:49:41,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-17 22:49:41,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-17 22:49:41,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-17 22:49:41,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-17 22:49:41,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-17 22:49:41,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-17 22:49:41,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-17 22:49:41,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-17 22:49:41,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-17 22:49:41,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-17 22:49:41,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-17 22:49:41,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-17 22:49:41,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-17 22:49:41,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-17 22:49:41,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-17 22:49:41,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-17 22:49:41,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-17 22:49:41,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-17 22:49:41,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-17 22:49:41,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-17 22:49:41,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-17 22:49:41,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-17 22:49:41,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-17 22:49:41,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-17 22:49:41,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-17 22:49:41,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-17 22:49:41,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-17 22:49:41,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-17 22:49:41,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-17 22:49:41,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-17 22:49:41,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-04-17 22:49:41,461 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-17 22:49:41,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-17 22:49:41,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-17 22:49:41,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-17 22:49:41,464 INFO L138 SettingsManager]: * Use SBE=true [2020-04-17 22:49:41,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-17 22:49:41,465 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-17 22:49:41,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-17 22:49:41,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-17 22:49:41,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-17 22:49:41,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-17 22:49:41,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-17 22:49:41,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-17 22:49:41,468 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-17 22:49:41,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-17 22:49:41,468 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-17 22:49:41,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-17 22:49:41,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-17 22:49:41,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-17 22:49:41,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-17 22:49:41,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-17 22:49:41,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-17 22:49:41,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-17 22:49:41,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-17 22:49:41,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-17 22:49:41,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-17 22:49:41,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-17 22:49:41,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-17 22:49:41,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-17 22:49:41,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-17 22:49:41,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-17 22:49:41,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-17 22:49:41,790 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-17 22:49:41,790 INFO L275 PluginConnector]: CDTParser initialized [2020-04-17 22:49:41,791 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-17 22:49:41,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00612ad1b/051008d1b86b4a559654b271be4dbcd2/FLAG7fdcfbe22 [2020-04-17 22:49:42,475 INFO L306 CDTParser]: Found 1 translation units. [2020-04-17 22:49:42,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2020-04-17 22:49:42,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00612ad1b/051008d1b86b4a559654b271be4dbcd2/FLAG7fdcfbe22 [2020-04-17 22:49:42,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00612ad1b/051008d1b86b4a559654b271be4dbcd2 [2020-04-17 22:49:42,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-17 22:49:42,853 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-17 22:49:42,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-17 22:49:42,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-17 22:49:42,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-17 22:49:42,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:49:42" (1/1) ... [2020-04-17 22:49:42,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c48a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:42, skipping insertion in model container [2020-04-17 22:49:42,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:49:42" (1/1) ... [2020-04-17 22:49:42,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-17 22:49:42,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-17 22:49:43,096 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:49:43,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:49:43,603 INFO L203 MainTranslator]: Completed pre-run [2020-04-17 22:49:43,614 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:49:43,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:49:43,891 INFO L208 MainTranslator]: Completed translation [2020-04-17 22:49:43,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43 WrapperNode [2020-04-17 22:49:43,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-17 22:49:43,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-17 22:49:43,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-17 22:49:43,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-17 22:49:43,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:43,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-17 22:49:44,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-17 22:49:44,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-17 22:49:44,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-17 22:49:44,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (1/1) ... [2020-04-17 22:49:44,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-17 22:49:44,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-17 22:49:44,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-17 22:49:44,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-17 22:49:44,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (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-17 22:49:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-04-17 22:49:44,156 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-04-17 22:49:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-04-17 22:49:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-04-17 22:49:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-17 22:49:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-17 22:49:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-17 22:49:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-17 22:49:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-17 22:49:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-17 22:49:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-17 22:49:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-17 22:49:44,160 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-17 22:49:44,855 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-17 22:49:44,855 INFO L295 CfgBuilder]: Removed 22 assume(true) statements. [2020-04-17 22:49:44,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:49:44 BoogieIcfgContainer [2020-04-17 22:49:44,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-17 22:49:44,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-17 22:49:44,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-17 22:49:44,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-17 22:49:44,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.04 10:49:42" (1/3) ... [2020-04-17 22:49:44,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531d5925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:49:44, skipping insertion in model container [2020-04-17 22:49:44,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:43" (2/3) ... [2020-04-17 22:49:44,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531d5925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:49:44, skipping insertion in model container [2020-04-17 22:49:44,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:49:44" (3/3) ... [2020-04-17 22:49:44,877 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2020-04-17 22:49:44,888 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-17 22:49:44,888 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-17 22:49:44,898 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-04-17 22:49:44,899 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-17 22:49:44,960 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,960 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,961 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,961 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,961 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,961 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,962 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,962 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,962 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,962 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,962 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,963 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,963 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,963 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,963 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,963 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,964 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,964 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,964 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,964 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,964 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,965 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,965 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,965 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,965 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,965 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,965 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,966 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,966 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,966 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,966 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,966 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,967 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,967 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,967 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,967 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,968 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,969 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,970 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,970 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,970 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,970 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,971 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,971 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,971 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,972 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,972 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,972 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,972 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,972 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,973 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,973 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,973 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,973 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,973 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,974 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,974 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,974 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,974 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,975 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,975 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,976 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,976 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,976 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,976 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,976 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,977 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,977 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,977 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,978 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,978 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,978 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,978 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,978 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,978 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,979 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,979 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,979 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,979 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,979 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,980 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,980 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,981 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,981 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,981 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,981 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,982 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,982 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,982 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,982 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,983 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,983 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,983 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,983 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,984 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,984 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,984 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,986 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,986 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,986 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,986 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,987 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,991 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,991 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,992 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,992 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,999 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,999 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:44,999 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,000 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,000 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,001 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,001 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,001 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,001 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,001 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,002 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,002 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,002 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,002 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,003 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,003 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,003 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,004 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,004 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,004 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,004 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,004 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,004 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,005 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,005 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,005 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,005 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,005 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,006 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,006 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,006 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,006 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,006 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,007 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,007 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,007 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,007 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,007 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,007 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,008 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,008 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,008 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,008 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,008 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,009 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,009 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,009 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,009 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,010 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,010 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,010 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,010 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,010 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,010 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,011 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,011 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,011 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,011 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,012 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,012 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,012 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,012 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,012 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,013 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,014 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,014 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,015 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,016 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,016 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,016 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,016 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,016 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,016 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,017 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,017 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,017 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,017 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,017 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,018 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,018 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,018 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,018 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,018 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,018 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,019 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,019 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,019 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,019 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,020 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,020 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,020 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,020 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,021 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,021 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,021 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,021 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,021 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,022 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,022 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,022 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,022 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,022 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,022 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,023 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,023 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,023 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,028 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,032 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,032 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,033 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,033 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,033 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,033 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,033 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,034 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,034 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,035 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,040 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,040 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,040 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,041 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,041 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,043 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,043 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,044 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,044 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,044 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,044 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,044 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,044 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,045 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,045 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,045 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,046 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,046 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,047 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,054 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,054 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,055 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,055 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,055 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,055 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,055 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,056 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,056 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,056 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,056 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,056 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,056 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,057 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,057 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,057 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,057 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,057 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,057 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:45,079 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-04-17 22:49:45,101 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-17 22:49:45,101 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-17 22:49:45,101 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-17 22:49:45,102 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-17 22:49:45,102 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-17 22:49:45,102 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-17 22:49:45,102 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-17 22:49:45,102 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-17 22:49:45,126 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 201 transitions, 424 flow [2020-04-17 22:49:45,128 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions, 424 flow [2020-04-17 22:49:45,241 INFO L129 PetriNetUnfolder]: 18/201 cut-off events. [2020-04-17 22:49:45,241 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-17 22:49:45,251 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-17 22:49:45,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions, 424 flow [2020-04-17 22:49:45,340 INFO L129 PetriNetUnfolder]: 18/201 cut-off events. [2020-04-17 22:49:45,340 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-17 22:49:45,345 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-17 22:49:45,361 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16584 [2020-04-17 22:49:45,362 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-17 22:49:47,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:48,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:49,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:49,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:49:49,942 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-04-17 22:49:50,424 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-04-17 22:49:50,591 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-04-17 22:49:50,761 INFO L206 etLargeBlockEncoding]: Checked pairs total: 27423 [2020-04-17 22:49:50,761 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2020-04-17 22:49:50,765 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 65 transitions, 152 flow [2020-04-17 22:49:50,926 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2020-04-17 22:49:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2020-04-17 22:49:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:50,950 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:50,951 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:50,951 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-17 22:49:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash 244665820, now seen corresponding path program 1 times [2020-04-17 22:49:50,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:50,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045628055] [2020-04-17 22:49:50,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:51,465 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-17 22:49:51,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045628055] [2020-04-17 22:49:51,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:51,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-17 22:49:51,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626654823] [2020-04-17 22:49:51,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-17 22:49:51,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-17 22:49:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-04-17 22:49:51,505 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 6 states. [2020-04-17 22:49:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:51,955 INFO L93 Difference]: Finished difference Result 2543 states and 8173 transitions. [2020-04-17 22:49:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-17 22:49:51,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-04-17 22:49:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:51,998 INFO L225 Difference]: With dead ends: 2543 [2020-04-17 22:49:51,998 INFO L226 Difference]: Without dead ends: 2405 [2020-04-17 22:49:52,000 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-17 22:49:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2020-04-17 22:49:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2020-04-17 22:49:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2020-04-17 22:49:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2020-04-17 22:49:52,156 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2020-04-17 22:49:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:52,157 INFO L479 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2020-04-17 22:49:52,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-17 22:49:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2020-04-17 22:49:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:49:52,161 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:52,161 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-17 22:49:52,161 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-17 22:49:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:52,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1321724129, now seen corresponding path program 1 times [2020-04-17 22:49:52,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:52,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802802408] [2020-04-17 22:49:52,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:52,327 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-17 22:49:52,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802802408] [2020-04-17 22:49:52,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:52,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 22:49:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744651036] [2020-04-17 22:49:52,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 22:49:52,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 22:49:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-04-17 22:49:52,331 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2020-04-17 22:49:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:52,996 INFO L93 Difference]: Finished difference Result 3979 states and 13124 transitions. [2020-04-17 22:49:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-17 22:49:52,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-17 22:49:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:53,036 INFO L225 Difference]: With dead ends: 3979 [2020-04-17 22:49:53,037 INFO L226 Difference]: Without dead ends: 3939 [2020-04-17 22:49:53,039 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-17 22:49:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2020-04-17 22:49:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2948. [2020-04-17 22:49:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-04-17 22:49:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 9594 transitions. [2020-04-17 22:49:53,297 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 9594 transitions. Word has length 18 [2020-04-17 22:49:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:53,297 INFO L479 AbstractCegarLoop]: Abstraction has 2948 states and 9594 transitions. [2020-04-17 22:49:53,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 22:49:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 9594 transitions. [2020-04-17 22:49:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:49:53,302 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:53,302 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-17 22:49:53,302 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-17 22:49:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash 422147485, now seen corresponding path program 2 times [2020-04-17 22:49:53,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:53,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509330861] [2020-04-17 22:49:53,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:53,597 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-17 22:49:53,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509330861] [2020-04-17 22:49:53,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:53,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 22:49:53,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533571460] [2020-04-17 22:49:53,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 22:49:53,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 22:49:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-17 22:49:53,600 INFO L87 Difference]: Start difference. First operand 2948 states and 9594 transitions. Second operand 7 states. [2020-04-17 22:49:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:54,109 INFO L93 Difference]: Finished difference Result 3485 states and 11281 transitions. [2020-04-17 22:49:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-17 22:49:54,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-17 22:49:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:54,136 INFO L225 Difference]: With dead ends: 3485 [2020-04-17 22:49:54,136 INFO L226 Difference]: Without dead ends: 3437 [2020-04-17 22:49:54,138 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-04-17 22:49:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-04-17 22:49:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2898. [2020-04-17 22:49:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2020-04-17 22:49:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2020-04-17 22:49:54,247 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2020-04-17 22:49:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:54,248 INFO L479 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2020-04-17 22:49:54,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 22:49:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2020-04-17 22:49:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:49:54,254 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:54,254 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-17 22:49:54,254 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-17 22:49:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash 456238224, now seen corresponding path program 1 times [2020-04-17 22:49:54,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:54,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691087976] [2020-04-17 22:49:54,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:54,846 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-17 22:49:54,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691087976] [2020-04-17 22:49:54,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:54,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:54,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620319482] [2020-04-17 22:49:54,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:54,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:54,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:54,848 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 13 states. [2020-04-17 22:49:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:56,690 INFO L93 Difference]: Finished difference Result 3440 states and 11205 transitions. [2020-04-17 22:49:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 22:49:56,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:49:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:56,714 INFO L225 Difference]: With dead ends: 3440 [2020-04-17 22:49:56,714 INFO L226 Difference]: Without dead ends: 3440 [2020-04-17 22:49:56,715 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2020-04-17 22:49:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2020-04-17 22:49:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3017. [2020-04-17 22:49:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2020-04-17 22:49:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 9857 transitions. [2020-04-17 22:49:56,804 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 9857 transitions. Word has length 25 [2020-04-17 22:49:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:56,805 INFO L479 AbstractCegarLoop]: Abstraction has 3017 states and 9857 transitions. [2020-04-17 22:49:56,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 9857 transitions. [2020-04-17 22:49:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:49:56,812 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:56,812 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-17 22:49:56,813 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-17 22:49:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash -556454308, now seen corresponding path program 2 times [2020-04-17 22:49:56,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:56,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625890173] [2020-04-17 22:49:56,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:57,359 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-17 22:49:57,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625890173] [2020-04-17 22:49:57,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:57,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737504801] [2020-04-17 22:49:57,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:57,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:57,361 INFO L87 Difference]: Start difference. First operand 3017 states and 9857 transitions. Second operand 13 states. [2020-04-17 22:49:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:59,286 INFO L93 Difference]: Finished difference Result 3469 states and 11302 transitions. [2020-04-17 22:49:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-17 22:49:59,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:49:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:59,369 INFO L225 Difference]: With dead ends: 3469 [2020-04-17 22:49:59,369 INFO L226 Difference]: Without dead ends: 3469 [2020-04-17 22:49:59,370 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2020-04-17 22:49:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2020-04-17 22:49:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3234. [2020-04-17 22:49:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-04-17 22:49:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 10616 transitions. [2020-04-17 22:49:59,480 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 10616 transitions. Word has length 25 [2020-04-17 22:49:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:59,480 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 10616 transitions. [2020-04-17 22:49:59,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 10616 transitions. [2020-04-17 22:49:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:49:59,488 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:59,488 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-17 22:49:59,488 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-17 22:49:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash -389201428, now seen corresponding path program 3 times [2020-04-17 22:49:59,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:59,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590647068] [2020-04-17 22:49:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:00,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-17 22:50:00,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590647068] [2020-04-17 22:50:00,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:00,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:00,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702754452] [2020-04-17 22:50:00,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:00,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:00,072 INFO L87 Difference]: Start difference. First operand 3234 states and 10616 transitions. Second operand 13 states. [2020-04-17 22:50:01,796 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-04-17 22:50:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:02,141 INFO L93 Difference]: Finished difference Result 3504 states and 11329 transitions. [2020-04-17 22:50:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 22:50:02,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:02,163 INFO L225 Difference]: With dead ends: 3504 [2020-04-17 22:50:02,164 INFO L226 Difference]: Without dead ends: 3504 [2020-04-17 22:50:02,164 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2020-04-17 22:50:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2020-04-17 22:50:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3388. [2020-04-17 22:50:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2020-04-17 22:50:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 11017 transitions. [2020-04-17 22:50:02,275 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 11017 transitions. Word has length 25 [2020-04-17 22:50:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:02,275 INFO L479 AbstractCegarLoop]: Abstraction has 3388 states and 11017 transitions. [2020-04-17 22:50:02,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 11017 transitions. [2020-04-17 22:50:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:02,283 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:02,283 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-17 22:50:02,283 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-17 22:50:02,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:02,284 INFO L82 PathProgramCache]: Analyzing trace with hash -624413205, now seen corresponding path program 1 times [2020-04-17 22:50:02,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:02,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202676140] [2020-04-17 22:50:02,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:02,852 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-17 22:50:02,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202676140] [2020-04-17 22:50:02,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:02,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:02,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822594801] [2020-04-17 22:50:02,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:02,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:02,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:02,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:02,854 INFO L87 Difference]: Start difference. First operand 3388 states and 11017 transitions. Second operand 14 states. [2020-04-17 22:50:04,164 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-04-17 22:50:04,408 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-04-17 22:50:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:04,853 INFO L93 Difference]: Finished difference Result 4020 states and 12998 transitions. [2020-04-17 22:50:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 22:50:04,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:04,866 INFO L225 Difference]: With dead ends: 4020 [2020-04-17 22:50:04,867 INFO L226 Difference]: Without dead ends: 4020 [2020-04-17 22:50:04,867 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-04-17 22:50:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2020-04-17 22:50:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3514. [2020-04-17 22:50:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2020-04-17 22:50:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 11403 transitions. [2020-04-17 22:50:04,967 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 11403 transitions. Word has length 25 [2020-04-17 22:50:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:04,968 INFO L479 AbstractCegarLoop]: Abstraction has 3514 states and 11403 transitions. [2020-04-17 22:50:04,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 11403 transitions. [2020-04-17 22:50:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:04,975 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:04,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-17 22:50:04,976 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-17 22:50:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash 106947557, now seen corresponding path program 2 times [2020-04-17 22:50:04,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:04,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330836266] [2020-04-17 22:50:04,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:05,450 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-17 22:50:05,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330836266] [2020-04-17 22:50:05,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:05,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:05,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968610365] [2020-04-17 22:50:05,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:05,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:05,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:05,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:05,452 INFO L87 Difference]: Start difference. First operand 3514 states and 11403 transitions. Second operand 14 states. [2020-04-17 22:50:06,991 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2020-04-17 22:50:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:07,326 INFO L93 Difference]: Finished difference Result 4056 states and 13114 transitions. [2020-04-17 22:50:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-17 22:50:07,327 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:07,338 INFO L225 Difference]: With dead ends: 4056 [2020-04-17 22:50:07,339 INFO L226 Difference]: Without dead ends: 4056 [2020-04-17 22:50:07,339 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:50:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2020-04-17 22:50:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3584. [2020-04-17 22:50:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2020-04-17 22:50:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11673 transitions. [2020-04-17 22:50:07,546 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11673 transitions. Word has length 25 [2020-04-17 22:50:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:07,547 INFO L479 AbstractCegarLoop]: Abstraction has 3584 states and 11673 transitions. [2020-04-17 22:50:07,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11673 transitions. [2020-04-17 22:50:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:07,558 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:07,558 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-17 22:50:07,558 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-17 22:50:07,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2012965443, now seen corresponding path program 3 times [2020-04-17 22:50:07,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:07,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302490969] [2020-04-17 22:50:07,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:08,023 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-17 22:50:08,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302490969] [2020-04-17 22:50:08,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:08,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:08,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322725288] [2020-04-17 22:50:08,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:08,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:08,025 INFO L87 Difference]: Start difference. First operand 3584 states and 11673 transitions. Second operand 14 states. [2020-04-17 22:50:10,431 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-04-17 22:50:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:10,902 INFO L93 Difference]: Finished difference Result 4022 states and 12928 transitions. [2020-04-17 22:50:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:50:10,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:10,924 INFO L225 Difference]: With dead ends: 4022 [2020-04-17 22:50:10,924 INFO L226 Difference]: Without dead ends: 4022 [2020-04-17 22:50:10,925 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-17 22:50:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2020-04-17 22:50:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3794. [2020-04-17 22:50:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2020-04-17 22:50:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 12303 transitions. [2020-04-17 22:50:11,055 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 12303 transitions. Word has length 25 [2020-04-17 22:50:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:11,055 INFO L479 AbstractCegarLoop]: Abstraction has 3794 states and 12303 transitions. [2020-04-17 22:50:11,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 12303 transitions. [2020-04-17 22:50:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:11,064 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:11,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] [2020-04-17 22:50:11,064 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-17 22:50:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash 84923173, now seen corresponding path program 4 times [2020-04-17 22:50:11,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:11,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2687162] [2020-04-17 22:50:11,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:11,688 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-17 22:50:11,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2687162] [2020-04-17 22:50:11,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:11,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:11,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890814821] [2020-04-17 22:50:11,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:11,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:11,690 INFO L87 Difference]: Start difference. First operand 3794 states and 12303 transitions. Second operand 13 states. [2020-04-17 22:50:13,581 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 22:50:13,863 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-04-17 22:50:14,025 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-04-17 22:50:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:14,444 INFO L93 Difference]: Finished difference Result 4190 states and 13502 transitions. [2020-04-17 22:50:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:14,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:14,451 INFO L225 Difference]: With dead ends: 4190 [2020-04-17 22:50:14,451 INFO L226 Difference]: Without dead ends: 4190 [2020-04-17 22:50:14,452 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2020-04-17 22:50:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4005. [2020-04-17 22:50:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4005 states. [2020-04-17 22:50:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 12969 transitions. [2020-04-17 22:50:14,547 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 12969 transitions. Word has length 25 [2020-04-17 22:50:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:14,547 INFO L479 AbstractCegarLoop]: Abstraction has 4005 states and 12969 transitions. [2020-04-17 22:50:14,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 12969 transitions. [2020-04-17 22:50:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:14,559 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:14,559 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-17 22:50:14,559 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-17 22:50:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1775574389, now seen corresponding path program 5 times [2020-04-17 22:50:14,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:14,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897907211] [2020-04-17 22:50:14,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:15,109 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-17 22:50:15,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897907211] [2020-04-17 22:50:15,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:15,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:15,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114083684] [2020-04-17 22:50:15,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:15,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:15,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:15,111 INFO L87 Difference]: Start difference. First operand 4005 states and 12969 transitions. Second operand 14 states. [2020-04-17 22:50:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:16,895 INFO L93 Difference]: Finished difference Result 4067 states and 13143 transitions. [2020-04-17 22:50:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:50:16,896 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:16,903 INFO L225 Difference]: With dead ends: 4067 [2020-04-17 22:50:16,903 INFO L226 Difference]: Without dead ends: 4067 [2020-04-17 22:50:16,904 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2020-04-17 22:50:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2020-04-17 22:50:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3948. [2020-04-17 22:50:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-04-17 22:50:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2020-04-17 22:50:16,993 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2020-04-17 22:50:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:16,993 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2020-04-17 22:50:16,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2020-04-17 22:50:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:17,000 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:17,000 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-17 22:50:17,000 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-17 22:50:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1770005220, now seen corresponding path program 4 times [2020-04-17 22:50:17,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:17,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323721063] [2020-04-17 22:50:17,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:17,510 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-17 22:50:17,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323721063] [2020-04-17 22:50:17,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:17,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:17,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997721076] [2020-04-17 22:50:17,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:17,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:17,514 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 13 states. [2020-04-17 22:50:18,661 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-04-17 22:50:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:19,040 INFO L93 Difference]: Finished difference Result 4050 states and 13039 transitions. [2020-04-17 22:50:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:50:19,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:19,047 INFO L225 Difference]: With dead ends: 4050 [2020-04-17 22:50:19,047 INFO L226 Difference]: Without dead ends: 4050 [2020-04-17 22:50:19,048 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2020-04-17 22:50:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2020-04-17 22:50:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3990. [2020-04-17 22:50:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2020-04-17 22:50:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 12909 transitions. [2020-04-17 22:50:19,134 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 12909 transitions. Word has length 25 [2020-04-17 22:50:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:19,135 INFO L479 AbstractCegarLoop]: Abstraction has 3990 states and 12909 transitions. [2020-04-17 22:50:19,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 12909 transitions. [2020-04-17 22:50:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:19,142 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:19,142 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-17 22:50:19,142 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-17 22:50:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 757312688, now seen corresponding path program 5 times [2020-04-17 22:50:19,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:19,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394100589] [2020-04-17 22:50:19,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:19,569 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-17 22:50:19,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394100589] [2020-04-17 22:50:19,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:19,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:19,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126565212] [2020-04-17 22:50:19,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:19,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:19,571 INFO L87 Difference]: Start difference. First operand 3990 states and 12909 transitions. Second operand 13 states. [2020-04-17 22:50:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:21,103 INFO L93 Difference]: Finished difference Result 4365 states and 14099 transitions. [2020-04-17 22:50:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 22:50:21,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:21,111 INFO L225 Difference]: With dead ends: 4365 [2020-04-17 22:50:21,112 INFO L226 Difference]: Without dead ends: 4365 [2020-04-17 22:50:21,112 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2020-04-17 22:50:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2020-04-17 22:50:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4186. [2020-04-17 22:50:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2020-04-17 22:50:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 13595 transitions. [2020-04-17 22:50:21,267 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 13595 transitions. Word has length 25 [2020-04-17 22:50:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:21,268 INFO L479 AbstractCegarLoop]: Abstraction has 4186 states and 13595 transitions. [2020-04-17 22:50:21,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 13595 transitions. [2020-04-17 22:50:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:21,278 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:21,279 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-17 22:50:21,279 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-17 22:50:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash 924565568, now seen corresponding path program 6 times [2020-04-17 22:50:21,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:21,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122510331] [2020-04-17 22:50:21,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:21,918 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-17 22:50:21,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122510331] [2020-04-17 22:50:21,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:21,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:21,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519674328] [2020-04-17 22:50:21,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:21,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:21,921 INFO L87 Difference]: Start difference. First operand 4186 states and 13595 transitions. Second operand 13 states. [2020-04-17 22:50:23,710 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2020-04-17 22:50:23,906 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-04-17 22:50:24,167 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-04-17 22:50:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:24,532 INFO L93 Difference]: Finished difference Result 4946 states and 15775 transitions. [2020-04-17 22:50:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:24,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:24,540 INFO L225 Difference]: With dead ends: 4946 [2020-04-17 22:50:24,540 INFO L226 Difference]: Without dead ends: 4946 [2020-04-17 22:50:24,541 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2020-04-17 22:50:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 3878. [2020-04-17 22:50:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3878 states. [2020-04-17 22:50:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 12497 transitions. [2020-04-17 22:50:24,633 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 12497 transitions. Word has length 25 [2020-04-17 22:50:24,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:24,633 INFO L479 AbstractCegarLoop]: Abstraction has 3878 states and 12497 transitions. [2020-04-17 22:50:24,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 12497 transitions. [2020-04-17 22:50:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:24,640 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:24,640 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-17 22:50:24,640 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-17 22:50:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -908781430, now seen corresponding path program 7 times [2020-04-17 22:50:24,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:24,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631509093] [2020-04-17 22:50:24,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:25,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-17 22:50:25,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631509093] [2020-04-17 22:50:25,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:25,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:25,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580344358] [2020-04-17 22:50:25,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:25,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:25,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:25,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:25,095 INFO L87 Difference]: Start difference. First operand 3878 states and 12497 transitions. Second operand 13 states. [2020-04-17 22:50:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:26,740 INFO L93 Difference]: Finished difference Result 3913 states and 12607 transitions. [2020-04-17 22:50:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:50:26,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:26,747 INFO L225 Difference]: With dead ends: 3913 [2020-04-17 22:50:26,747 INFO L226 Difference]: Without dead ends: 3913 [2020-04-17 22:50:26,748 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2020-04-17 22:50:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2020-04-17 22:50:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3906. [2020-04-17 22:50:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2020-04-17 22:50:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 12585 transitions. [2020-04-17 22:50:26,825 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 12585 transitions. Word has length 25 [2020-04-17 22:50:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:26,826 INFO L479 AbstractCegarLoop]: Abstraction has 3906 states and 12585 transitions. [2020-04-17 22:50:26,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 12585 transitions. [2020-04-17 22:50:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:26,832 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:26,832 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-17 22:50:26,832 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-17 22:50:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -741528550, now seen corresponding path program 8 times [2020-04-17 22:50:26,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:26,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235974518] [2020-04-17 22:50:26,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:27,212 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-17 22:50:27,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235974518] [2020-04-17 22:50:27,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:27,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:27,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050057093] [2020-04-17 22:50:27,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:50:27,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:27,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:50:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:50:27,218 INFO L87 Difference]: Start difference. First operand 3906 states and 12585 transitions. Second operand 12 states. [2020-04-17 22:50:29,490 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2020-04-17 22:50:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:29,808 INFO L93 Difference]: Finished difference Result 4746 states and 15145 transitions. [2020-04-17 22:50:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:50:29,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-17 22:50:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:29,817 INFO L225 Difference]: With dead ends: 4746 [2020-04-17 22:50:29,817 INFO L226 Difference]: Without dead ends: 4746 [2020-04-17 22:50:29,818 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2020-04-17 22:50:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 3738. [2020-04-17 22:50:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2020-04-17 22:50:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 12057 transitions. [2020-04-17 22:50:29,938 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 12057 transitions. Word has length 25 [2020-04-17 22:50:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:29,938 INFO L479 AbstractCegarLoop]: Abstraction has 3738 states and 12057 transitions. [2020-04-17 22:50:29,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:50:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 12057 transitions. [2020-04-17 22:50:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:29,944 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:29,944 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-17 22:50:29,944 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-17 22:50:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1887146998, now seen corresponding path program 9 times [2020-04-17 22:50:29,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:29,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449328119] [2020-04-17 22:50:29,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:30,391 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-17 22:50:30,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449328119] [2020-04-17 22:50:30,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:30,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:30,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414409018] [2020-04-17 22:50:30,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:50:30,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:50:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:50:30,398 INFO L87 Difference]: Start difference. First operand 3738 states and 12057 transitions. Second operand 12 states. [2020-04-17 22:50:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:32,717 INFO L93 Difference]: Finished difference Result 4522 states and 14364 transitions. [2020-04-17 22:50:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:50:32,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-17 22:50:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:32,725 INFO L225 Difference]: With dead ends: 4522 [2020-04-17 22:50:32,725 INFO L226 Difference]: Without dead ends: 4522 [2020-04-17 22:50:32,725 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2020-04-17 22:50:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3612. [2020-04-17 22:50:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2020-04-17 22:50:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 11584 transitions. [2020-04-17 22:50:32,805 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 11584 transitions. Word has length 25 [2020-04-17 22:50:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:32,805 INFO L479 AbstractCegarLoop]: Abstraction has 3612 states and 11584 transitions. [2020-04-17 22:50:32,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:50:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 11584 transitions. [2020-04-17 22:50:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:32,811 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:32,811 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-17 22:50:32,811 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-17 22:50:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash 831016779, now seen corresponding path program 6 times [2020-04-17 22:50:32,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:32,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113874544] [2020-04-17 22:50:32,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:33,307 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-17 22:50:33,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113874544] [2020-04-17 22:50:33,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:33,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:33,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881176448] [2020-04-17 22:50:33,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:33,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:33,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:33,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:33,309 INFO L87 Difference]: Start difference. First operand 3612 states and 11584 transitions. Second operand 14 states. [2020-04-17 22:50:34,408 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-04-17 22:50:34,621 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-04-17 22:50:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:34,981 INFO L93 Difference]: Finished difference Result 3727 states and 11871 transitions. [2020-04-17 22:50:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:50:34,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:34,987 INFO L225 Difference]: With dead ends: 3727 [2020-04-17 22:50:34,987 INFO L226 Difference]: Without dead ends: 3727 [2020-04-17 22:50:34,988 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-17 22:50:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2020-04-17 22:50:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3661. [2020-04-17 22:50:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3661 states. [2020-04-17 22:50:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 11739 transitions. [2020-04-17 22:50:35,059 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 11739 transitions. Word has length 25 [2020-04-17 22:50:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:35,059 INFO L479 AbstractCegarLoop]: Abstraction has 3661 states and 11739 transitions. [2020-04-17 22:50:35,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 11739 transitions. [2020-04-17 22:50:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:35,063 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:35,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-17 22:50:35,063 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-17 22:50:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1562377541, now seen corresponding path program 7 times [2020-04-17 22:50:35,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:35,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18328353] [2020-04-17 22:50:35,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:35,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-17 22:50:35,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18328353] [2020-04-17 22:50:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:35,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758060199] [2020-04-17 22:50:35,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:35,604 INFO L87 Difference]: Start difference. First operand 3661 states and 11739 transitions. Second operand 14 states. [2020-04-17 22:50:37,061 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2020-04-17 22:50:37,315 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-04-17 22:50:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:37,770 INFO L93 Difference]: Finished difference Result 4179 states and 13299 transitions. [2020-04-17 22:50:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 22:50:37,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:37,778 INFO L225 Difference]: With dead ends: 4179 [2020-04-17 22:50:37,779 INFO L226 Difference]: Without dead ends: 4179 [2020-04-17 22:50:37,779 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2020-04-17 22:50:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2020-04-17 22:50:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3724. [2020-04-17 22:50:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2020-04-17 22:50:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 11982 transitions. [2020-04-17 22:50:37,848 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 11982 transitions. Word has length 25 [2020-04-17 22:50:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:37,848 INFO L479 AbstractCegarLoop]: Abstraction has 3724 states and 11982 transitions. [2020-04-17 22:50:37,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 11982 transitions. [2020-04-17 22:50:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:37,852 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:37,852 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-17 22:50:37,852 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-17 22:50:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash -557535459, now seen corresponding path program 8 times [2020-04-17 22:50:37,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:37,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395805635] [2020-04-17 22:50:37,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:38,340 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-17 22:50:38,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395805635] [2020-04-17 22:50:38,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:38,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:38,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293893330] [2020-04-17 22:50:38,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:38,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:38,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:38,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:38,343 INFO L87 Difference]: Start difference. First operand 3724 states and 11982 transitions. Second operand 14 states. [2020-04-17 22:50:40,037 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2020-04-17 22:50:40,322 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-04-17 22:50:40,600 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-04-17 22:50:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:41,013 INFO L93 Difference]: Finished difference Result 4145 states and 13127 transitions. [2020-04-17 22:50:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:41,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:41,020 INFO L225 Difference]: With dead ends: 4145 [2020-04-17 22:50:41,020 INFO L226 Difference]: Without dead ends: 4145 [2020-04-17 22:50:41,021 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2020-04-17 22:50:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3913. [2020-04-17 22:50:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2020-04-17 22:50:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 12549 transitions. [2020-04-17 22:50:41,074 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 12549 transitions. Word has length 25 [2020-04-17 22:50:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:41,074 INFO L479 AbstractCegarLoop]: Abstraction has 3913 states and 12549 transitions. [2020-04-17 22:50:41,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 12549 transitions. [2020-04-17 22:50:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:41,078 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:41,079 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-17 22:50:41,079 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-17 22:50:41,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1540353157, now seen corresponding path program 9 times [2020-04-17 22:50:41,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:41,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922796178] [2020-04-17 22:50:41,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:41,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-17 22:50:41,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922796178] [2020-04-17 22:50:41,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:41,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:41,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771538424] [2020-04-17 22:50:41,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:41,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:41,588 INFO L87 Difference]: Start difference. First operand 3913 states and 12549 transitions. Second operand 14 states. [2020-04-17 22:50:43,493 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-04-17 22:50:43,741 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-04-17 22:50:43,876 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-04-17 22:50:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:44,294 INFO L93 Difference]: Finished difference Result 4117 states and 13043 transitions. [2020-04-17 22:50:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:44,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:44,303 INFO L225 Difference]: With dead ends: 4117 [2020-04-17 22:50:44,303 INFO L226 Difference]: Without dead ends: 4117 [2020-04-17 22:50:44,304 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2020-04-17 22:50:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3976. [2020-04-17 22:50:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2020-04-17 22:50:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 12738 transitions. [2020-04-17 22:50:44,409 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 12738 transitions. Word has length 25 [2020-04-17 22:50:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:44,409 INFO L479 AbstractCegarLoop]: Abstraction has 3976 states and 12738 transitions. [2020-04-17 22:50:44,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 12738 transitions. [2020-04-17 22:50:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:44,414 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:44,414 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-17 22:50:44,414 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-17 22:50:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1880873459, now seen corresponding path program 10 times [2020-04-17 22:50:44,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:44,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676907814] [2020-04-17 22:50:44,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:44,909 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-17 22:50:44,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676907814] [2020-04-17 22:50:44,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:44,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:44,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166602983] [2020-04-17 22:50:44,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:44,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:44,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:44,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:44,911 INFO L87 Difference]: Start difference. First operand 3976 states and 12738 transitions. Second operand 14 states. [2020-04-17 22:50:47,054 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2020-04-17 22:50:47,234 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-04-17 22:50:47,511 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-04-17 22:50:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:47,827 INFO L93 Difference]: Finished difference Result 4726 states and 14878 transitions. [2020-04-17 22:50:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:50:47,827 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:47,836 INFO L225 Difference]: With dead ends: 4726 [2020-04-17 22:50:47,837 INFO L226 Difference]: Without dead ends: 4726 [2020-04-17 22:50:47,837 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-17 22:50:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2020-04-17 22:50:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3542. [2020-04-17 22:50:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2020-04-17 22:50:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2020-04-17 22:50:47,890 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2020-04-17 22:50:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:47,891 INFO L479 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2020-04-17 22:50:47,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2020-04-17 22:50:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:47,896 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:47,896 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-17 22:50:47,896 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-17 22:50:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -110028251, now seen corresponding path program 11 times [2020-04-17 22:50:47,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:47,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892454803] [2020-04-17 22:50:47,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:48,322 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-17 22:50:48,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892454803] [2020-04-17 22:50:48,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:48,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:48,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33215032] [2020-04-17 22:50:48,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:48,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:48,324 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 14 states. [2020-04-17 22:50:49,356 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-04-17 22:50:49,528 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2020-04-17 22:50:49,728 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-04-17 22:50:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:50,075 INFO L93 Difference]: Finished difference Result 3644 states and 11622 transitions. [2020-04-17 22:50:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:50:50,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:50,081 INFO L225 Difference]: With dead ends: 3644 [2020-04-17 22:50:50,081 INFO L226 Difference]: Without dead ends: 3644 [2020-04-17 22:50:50,081 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2020-04-17 22:50:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2020-04-17 22:50:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3584. [2020-04-17 22:50:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2020-04-17 22:50:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11502 transitions. [2020-04-17 22:50:50,135 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11502 transitions. Word has length 25 [2020-04-17 22:50:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:50,135 INFO L479 AbstractCegarLoop]: Abstraction has 3584 states and 11502 transitions. [2020-04-17 22:50:50,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11502 transitions. [2020-04-17 22:50:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:50,139 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:50,139 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-17 22:50:50,139 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-17 22:50:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2065026045, now seen corresponding path program 12 times [2020-04-17 22:50:50,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:50,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848090182] [2020-04-17 22:50:50,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:50,534 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-17 22:50:50,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848090182] [2020-04-17 22:50:50,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:50,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:50,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501005078] [2020-04-17 22:50:50,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:50,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:50,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:50,536 INFO L87 Difference]: Start difference. First operand 3584 states and 11502 transitions. Second operand 14 states. [2020-04-17 22:50:52,092 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-04-17 22:50:52,223 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-04-17 22:50:52,491 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2020-04-17 22:50:52,741 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-04-17 22:50:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:53,185 INFO L93 Difference]: Finished difference Result 3945 states and 12527 transitions. [2020-04-17 22:50:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:50:53,185 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:53,192 INFO L225 Difference]: With dead ends: 3945 [2020-04-17 22:50:53,192 INFO L226 Difference]: Without dead ends: 3945 [2020-04-17 22:50:53,193 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:50:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2020-04-17 22:50:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3773. [2020-04-17 22:50:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3773 states. [2020-04-17 22:50:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 12069 transitions. [2020-04-17 22:50:53,244 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 12069 transitions. Word has length 25 [2020-04-17 22:50:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:53,244 INFO L479 AbstractCegarLoop]: Abstraction has 3773 states and 12069 transitions. [2020-04-17 22:50:53,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 12069 transitions. [2020-04-17 22:50:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:53,248 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:53,248 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-17 22:50:53,248 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-17 22:50:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash -132052635, now seen corresponding path program 13 times [2020-04-17 22:50:53,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:53,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428678566] [2020-04-17 22:50:53,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:53,654 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-17 22:50:53,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428678566] [2020-04-17 22:50:53,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:53,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:53,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149699913] [2020-04-17 22:50:53,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:53,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:53,656 INFO L87 Difference]: Start difference. First operand 3773 states and 12069 transitions. Second operand 14 states. [2020-04-17 22:50:55,480 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-04-17 22:50:55,705 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-04-17 22:50:55,835 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-04-17 22:50:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:56,243 INFO L93 Difference]: Finished difference Result 3917 states and 12443 transitions. [2020-04-17 22:50:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:50:56,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:56,250 INFO L225 Difference]: With dead ends: 3917 [2020-04-17 22:50:56,250 INFO L226 Difference]: Without dead ends: 3917 [2020-04-17 22:50:56,251 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-17 22:50:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2020-04-17 22:50:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3836. [2020-04-17 22:50:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2020-04-17 22:50:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12258 transitions. [2020-04-17 22:50:56,303 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12258 transitions. Word has length 25 [2020-04-17 22:50:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:56,303 INFO L479 AbstractCegarLoop]: Abstraction has 3836 states and 12258 transitions. [2020-04-17 22:50:56,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12258 transitions. [2020-04-17 22:50:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:56,307 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:56,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] [2020-04-17 22:50:56,308 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-17 22:50:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:56,308 INFO L82 PathProgramCache]: Analyzing trace with hash 741688045, now seen corresponding path program 14 times [2020-04-17 22:50:56,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:56,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399931362] [2020-04-17 22:50:56,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:56,801 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-17 22:50:56,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399931362] [2020-04-17 22:50:56,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:56,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:56,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64055706] [2020-04-17 22:50:56,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:50:56,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:56,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:50:56,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:50:56,803 INFO L87 Difference]: Start difference. First operand 3836 states and 12258 transitions. Second operand 14 states. [2020-04-17 22:50:58,043 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-04-17 22:50:59,275 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 22:50:59,549 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-04-17 22:50:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:59,848 INFO L93 Difference]: Finished difference Result 4526 states and 14278 transitions. [2020-04-17 22:50:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-17 22:50:59,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:50:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:59,855 INFO L225 Difference]: With dead ends: 4526 [2020-04-17 22:50:59,856 INFO L226 Difference]: Without dead ends: 4526 [2020-04-17 22:50:59,856 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2020-04-17 22:50:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2020-04-17 22:50:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3472. [2020-04-17 22:50:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2020-04-17 22:50:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 11104 transitions. [2020-04-17 22:50:59,922 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 11104 transitions. Word has length 25 [2020-04-17 22:50:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:59,922 INFO L479 AbstractCegarLoop]: Abstraction has 3472 states and 11104 transitions. [2020-04-17 22:50:59,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:50:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 11104 transitions. [2020-04-17 22:50:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:59,925 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:59,926 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-17 22:50:59,926 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-17 22:50:59,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1027185563, now seen corresponding path program 15 times [2020-04-17 22:50:59,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:59,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698146256] [2020-04-17 22:50:59,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:00,444 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-17 22:51:00,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698146256] [2020-04-17 22:51:00,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:00,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:00,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655491892] [2020-04-17 22:51:00,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:51:00,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:51:00,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:51:00,446 INFO L87 Difference]: Start difference. First operand 3472 states and 11104 transitions. Second operand 14 states. [2020-04-17 22:51:01,886 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2020-04-17 22:51:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:02,375 INFO L93 Difference]: Finished difference Result 3633 states and 11512 transitions. [2020-04-17 22:51:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:51:02,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:51:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:02,382 INFO L225 Difference]: With dead ends: 3633 [2020-04-17 22:51:02,382 INFO L226 Difference]: Without dead ends: 3633 [2020-04-17 22:51:02,383 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2020-04-17 22:51:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2020-04-17 22:51:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3633. [2020-04-17 22:51:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2020-04-17 22:51:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 11512 transitions. [2020-04-17 22:51:02,432 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 11512 transitions. Word has length 25 [2020-04-17 22:51:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:02,433 INFO L479 AbstractCegarLoop]: Abstraction has 3633 states and 11512 transitions. [2020-04-17 22:51:02,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:51:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 11512 transitions. [2020-04-17 22:51:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:51:02,438 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:02,438 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-17 22:51:02,439 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-17 22:51:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1070703053, now seen corresponding path program 16 times [2020-04-17 22:51:02,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:02,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460707095] [2020-04-17 22:51:02,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:02,869 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-17 22:51:02,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460707095] [2020-04-17 22:51:02,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:02,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:02,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111151335] [2020-04-17 22:51:02,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:51:02,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:51:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:51:02,871 INFO L87 Difference]: Start difference. First operand 3633 states and 11512 transitions. Second operand 14 states. [2020-04-17 22:51:05,112 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-04-17 22:51:05,249 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-04-17 22:51:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:05,676 INFO L93 Difference]: Finished difference Result 3724 states and 11787 transitions. [2020-04-17 22:51:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:51:05,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:51:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:05,682 INFO L225 Difference]: With dead ends: 3724 [2020-04-17 22:51:05,683 INFO L226 Difference]: Without dead ends: 3724 [2020-04-17 22:51:05,683 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:51:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-04-17 22:51:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3556. [2020-04-17 22:51:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2020-04-17 22:51:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 11281 transitions. [2020-04-17 22:51:05,731 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 11281 transitions. Word has length 25 [2020-04-17 22:51:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:05,731 INFO L479 AbstractCegarLoop]: Abstraction has 3556 states and 11281 transitions. [2020-04-17 22:51:05,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:51:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 11281 transitions. [2020-04-17 22:51:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:51:05,734 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:05,734 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-17 22:51:05,734 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-17 22:51:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443733, now seen corresponding path program 17 times [2020-04-17 22:51:05,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:05,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090122619] [2020-04-17 22:51:05,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:06,317 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-17 22:51:06,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090122619] [2020-04-17 22:51:06,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:06,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:06,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322990141] [2020-04-17 22:51:06,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:51:06,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:51:06,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:51:06,318 INFO L87 Difference]: Start difference. First operand 3556 states and 11281 transitions. Second operand 14 states. [2020-04-17 22:51:08,003 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-04-17 22:51:09,123 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-04-17 22:51:09,296 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2020-04-17 22:51:09,469 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-04-17 22:51:09,638 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-17 22:51:09,949 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2020-04-17 22:51:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:10,301 INFO L93 Difference]: Finished difference Result 4186 states and 13181 transitions. [2020-04-17 22:51:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-17 22:51:10,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:51:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:10,308 INFO L225 Difference]: With dead ends: 4186 [2020-04-17 22:51:10,308 INFO L226 Difference]: Without dead ends: 4186 [2020-04-17 22:51:10,309 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=346, Invalid=776, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 22:51:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2020-04-17 22:51:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3262. [2020-04-17 22:51:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-04-17 22:51:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 10397 transitions. [2020-04-17 22:51:10,365 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 10397 transitions. Word has length 25 [2020-04-17 22:51:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:10,365 INFO L479 AbstractCegarLoop]: Abstraction has 3262 states and 10397 transitions. [2020-04-17 22:51:10,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:51:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 10397 transitions. [2020-04-17 22:51:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:51:10,369 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:10,369 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-17 22:51:10,369 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-17 22:51:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash 137738405, now seen corresponding path program 18 times [2020-04-17 22:51:10,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:10,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994857794] [2020-04-17 22:51:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:10,794 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-17 22:51:10,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994857794] [2020-04-17 22:51:10,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:10,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:10,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141650863] [2020-04-17 22:51:10,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:51:10,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:51:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:51:10,796 INFO L87 Difference]: Start difference. First operand 3262 states and 10397 transitions. Second operand 14 states. [2020-04-17 22:51:12,462 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2020-04-17 22:51:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:12,765 INFO L93 Difference]: Finished difference Result 3276 states and 10441 transitions. [2020-04-17 22:51:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:51:12,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:51:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:12,772 INFO L225 Difference]: With dead ends: 3276 [2020-04-17 22:51:12,772 INFO L226 Difference]: Without dead ends: 3276 [2020-04-17 22:51:12,772 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2020-04-17 22:51:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2020-04-17 22:51:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2020-04-17 22:51:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2020-04-17 22:51:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 10441 transitions. [2020-04-17 22:51:12,817 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 10441 transitions. Word has length 25 [2020-04-17 22:51:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:12,817 INFO L479 AbstractCegarLoop]: Abstraction has 3276 states and 10441 transitions. [2020-04-17 22:51:12,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:51:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 10441 transitions. [2020-04-17 22:51:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:51:12,819 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:12,820 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-17 22:51:12,820 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-17 22:51:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1011479085, now seen corresponding path program 19 times [2020-04-17 22:51:12,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:12,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737692891] [2020-04-17 22:51:12,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:13,353 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-17 22:51:13,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737692891] [2020-04-17 22:51:13,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:13,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:13,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134940996] [2020-04-17 22:51:13,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:51:13,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:51:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:51:13,355 INFO L87 Difference]: Start difference. First operand 3276 states and 10441 transitions. Second operand 14 states. [2020-04-17 22:51:16,483 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-17 22:51:16,748 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2020-04-17 22:51:16,918 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-04-17 22:51:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:17,303 INFO L93 Difference]: Finished difference Result 4060 states and 12825 transitions. [2020-04-17 22:51:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-17 22:51:17,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 22:51:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:17,310 INFO L225 Difference]: With dead ends: 4060 [2020-04-17 22:51:17,310 INFO L226 Difference]: Without dead ends: 4060 [2020-04-17 22:51:17,311 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2020-04-17 22:51:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2020-04-17 22:51:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3206. [2020-04-17 22:51:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2020-04-17 22:51:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 10231 transitions. [2020-04-17 22:51:17,366 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 10231 transitions. Word has length 25 [2020-04-17 22:51:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:17,367 INFO L479 AbstractCegarLoop]: Abstraction has 3206 states and 10231 transitions. [2020-04-17 22:51:17,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:51:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 10231 transitions. [2020-04-17 22:51:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:17,370 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:17,370 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-17 22:51:17,371 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-17 22:51:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1573876017, now seen corresponding path program 1 times [2020-04-17 22:51:17,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:17,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127212004] [2020-04-17 22:51:17,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:17,990 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2020-04-17 22:51:18,239 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-17 22:51:18,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127212004] [2020-04-17 22:51:18,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:18,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:18,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222529826] [2020-04-17 22:51:18,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:18,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:18,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:18,241 INFO L87 Difference]: Start difference. First operand 3206 states and 10231 transitions. Second operand 16 states. [2020-04-17 22:51:19,787 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-04-17 22:51:20,007 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2020-04-17 22:51:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:21,098 INFO L93 Difference]: Finished difference Result 5138 states and 16527 transitions. [2020-04-17 22:51:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:21,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:21,107 INFO L225 Difference]: With dead ends: 5138 [2020-04-17 22:51:21,108 INFO L226 Difference]: Without dead ends: 5138 [2020-04-17 22:51:21,108 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2020-04-17 22:51:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3768. [2020-04-17 22:51:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2020-04-17 22:51:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12049 transitions. [2020-04-17 22:51:21,172 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12049 transitions. Word has length 27 [2020-04-17 22:51:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:21,172 INFO L479 AbstractCegarLoop]: Abstraction has 3768 states and 12049 transitions. [2020-04-17 22:51:21,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12049 transitions. [2020-04-17 22:51:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:21,175 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:21,175 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-17 22:51:21,175 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-17 22:51:21,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:21,175 INFO L82 PathProgramCache]: Analyzing trace with hash 186176923, now seen corresponding path program 2 times [2020-04-17 22:51:21,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:21,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123818005] [2020-04-17 22:51:21,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:21,678 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2020-04-17 22:51:21,874 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2020-04-17 22:51:22,197 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-17 22:51:22,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123818005] [2020-04-17 22:51:22,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:22,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:22,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533842570] [2020-04-17 22:51:22,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:22,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:22,199 INFO L87 Difference]: Start difference. First operand 3768 states and 12049 transitions. Second operand 17 states. [2020-04-17 22:51:23,889 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-04-17 22:51:24,095 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2020-04-17 22:51:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:25,406 INFO L93 Difference]: Finished difference Result 6226 states and 20077 transitions. [2020-04-17 22:51:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:25,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:51:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:25,416 INFO L225 Difference]: With dead ends: 6226 [2020-04-17 22:51:25,416 INFO L226 Difference]: Without dead ends: 6226 [2020-04-17 22:51:25,417 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2020-04-17 22:51:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2020-04-17 22:51:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 3978. [2020-04-17 22:51:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-04-17 22:51:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 12679 transitions. [2020-04-17 22:51:25,481 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 12679 transitions. Word has length 27 [2020-04-17 22:51:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:25,481 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 12679 transitions. [2020-04-17 22:51:25,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:51:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 12679 transitions. [2020-04-17 22:51:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:25,485 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:25,485 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-17 22:51:25,485 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-17 22:51:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1641843469, now seen corresponding path program 3 times [2020-04-17 22:51:25,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:25,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372370588] [2020-04-17 22:51:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:25,995 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 30 [2020-04-17 22:51:26,223 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-17 22:51:26,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372370588] [2020-04-17 22:51:26,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:26,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:26,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896983831] [2020-04-17 22:51:26,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:26,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:26,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:26,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:26,224 INFO L87 Difference]: Start difference. First operand 3978 states and 12679 transitions. Second operand 15 states. [2020-04-17 22:51:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:28,925 INFO L93 Difference]: Finished difference Result 6136 states and 19779 transitions. [2020-04-17 22:51:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:51:28,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:51:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:28,935 INFO L225 Difference]: With dead ends: 6136 [2020-04-17 22:51:28,935 INFO L226 Difference]: Without dead ends: 6136 [2020-04-17 22:51:28,936 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:51:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2020-04-17 22:51:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 4506. [2020-04-17 22:51:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2020-04-17 22:51:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14367 transitions. [2020-04-17 22:51:29,016 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14367 transitions. Word has length 27 [2020-04-17 22:51:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:29,016 INFO L479 AbstractCegarLoop]: Abstraction has 4506 states and 14367 transitions. [2020-04-17 22:51:29,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14367 transitions. [2020-04-17 22:51:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:29,020 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:29,020 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-17 22:51:29,020 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-17 22:51:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash 707987975, now seen corresponding path program 1 times [2020-04-17 22:51:29,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:29,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279050787] [2020-04-17 22:51:29,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:29,818 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-17 22:51:29,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279050787] [2020-04-17 22:51:29,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:29,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:29,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995713197] [2020-04-17 22:51:29,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:29,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:29,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:29,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:29,820 INFO L87 Difference]: Start difference. First operand 4506 states and 14367 transitions. Second operand 17 states. [2020-04-17 22:51:31,089 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-04-17 22:51:31,280 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:51:31,565 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:51:31,784 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-04-17 22:51:32,039 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-04-17 22:51:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:33,311 INFO L93 Difference]: Finished difference Result 6526 states and 20927 transitions. [2020-04-17 22:51:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:51:33,312 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:51:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:33,322 INFO L225 Difference]: With dead ends: 6526 [2020-04-17 22:51:33,322 INFO L226 Difference]: Without dead ends: 6526 [2020-04-17 22:51:33,322 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-17 22:51:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2020-04-17 22:51:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 4736. [2020-04-17 22:51:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2020-04-17 22:51:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 15084 transitions. [2020-04-17 22:51:33,395 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 15084 transitions. Word has length 27 [2020-04-17 22:51:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:33,395 INFO L479 AbstractCegarLoop]: Abstraction has 4736 states and 15084 transitions. [2020-04-17 22:51:33,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:51:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 15084 transitions. [2020-04-17 22:51:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:33,400 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:33,400 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-17 22:51:33,400 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-17 22:51:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash -828956287, now seen corresponding path program 2 times [2020-04-17 22:51:33,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:33,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266433866] [2020-04-17 22:51:33,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:34,190 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-17 22:51:34,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266433866] [2020-04-17 22:51:34,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:34,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:34,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757728494] [2020-04-17 22:51:34,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:34,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:34,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:34,191 INFO L87 Difference]: Start difference. First operand 4736 states and 15084 transitions. Second operand 17 states. [2020-04-17 22:51:35,506 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-17 22:51:35,667 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:51:35,930 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:51:36,138 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-04-17 22:51:36,384 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2020-04-17 22:51:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:37,722 INFO L93 Difference]: Finished difference Result 7234 states and 23377 transitions. [2020-04-17 22:51:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:51:37,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:51:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:37,733 INFO L225 Difference]: With dead ends: 7234 [2020-04-17 22:51:37,733 INFO L226 Difference]: Without dead ends: 7234 [2020-04-17 22:51:37,734 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-17 22:51:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2020-04-17 22:51:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 5278. [2020-04-17 22:51:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5278 states. [2020-04-17 22:51:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 16935 transitions. [2020-04-17 22:51:37,821 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 16935 transitions. Word has length 27 [2020-04-17 22:51:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:37,821 INFO L479 AbstractCegarLoop]: Abstraction has 5278 states and 16935 transitions. [2020-04-17 22:51:37,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:51:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 16935 transitions. [2020-04-17 22:51:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:37,826 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:37,826 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-17 22:51:37,826 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-17 22:51:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash -828956293, now seen corresponding path program 1 times [2020-04-17 22:51:37,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:37,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762276259] [2020-04-17 22:51:37,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:38,504 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-04-17 22:51:38,759 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-17 22:51:38,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762276259] [2020-04-17 22:51:38,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:38,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:38,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894819804] [2020-04-17 22:51:38,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:38,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:38,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:38,761 INFO L87 Difference]: Start difference. First operand 5278 states and 16935 transitions. Second operand 17 states. [2020-04-17 22:51:39,938 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-04-17 22:51:40,098 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 22:51:40,332 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2020-04-17 22:51:40,524 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 22:51:40,764 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-04-17 22:51:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:41,979 INFO L93 Difference]: Finished difference Result 6805 states and 21785 transitions. [2020-04-17 22:51:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:51:41,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:51:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:41,992 INFO L225 Difference]: With dead ends: 6805 [2020-04-17 22:51:41,992 INFO L226 Difference]: Without dead ends: 6805 [2020-04-17 22:51:41,992 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-17 22:51:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2020-04-17 22:51:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 4796. [2020-04-17 22:51:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4796 states. [2020-04-17 22:51:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 15264 transitions. [2020-04-17 22:51:42,079 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 15264 transitions. Word has length 27 [2020-04-17 22:51:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:42,080 INFO L479 AbstractCegarLoop]: Abstraction has 4796 states and 15264 transitions. [2020-04-17 22:51:42,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:51:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 15264 transitions. [2020-04-17 22:51:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:42,085 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:42,085 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-17 22:51:42,085 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-17 22:51:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116313, now seen corresponding path program 3 times [2020-04-17 22:51:42,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:42,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996570009] [2020-04-17 22:51:42,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:42,744 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-17 22:51:42,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996570009] [2020-04-17 22:51:42,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:42,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:42,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441070993] [2020-04-17 22:51:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:42,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:42,745 INFO L87 Difference]: Start difference. First operand 4796 states and 15264 transitions. Second operand 16 states. [2020-04-17 22:51:43,381 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-04-17 22:51:43,622 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 22:51:44,031 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:51:44,316 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:51:44,610 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 22:51:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:46,199 INFO L93 Difference]: Finished difference Result 7448 states and 24096 transitions. [2020-04-17 22:51:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:46,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:46,217 INFO L225 Difference]: With dead ends: 7448 [2020-04-17 22:51:46,218 INFO L226 Difference]: Without dead ends: 7448 [2020-04-17 22:51:46,218 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2020-04-17 22:51:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5986. [2020-04-17 22:51:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2020-04-17 22:51:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 19163 transitions. [2020-04-17 22:51:46,317 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 19163 transitions. Word has length 27 [2020-04-17 22:51:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:46,317 INFO L479 AbstractCegarLoop]: Abstraction has 5986 states and 19163 transitions. [2020-04-17 22:51:46,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 19163 transitions. [2020-04-17 22:51:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:46,324 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:46,324 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-17 22:51:46,324 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-17 22:51:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116307, now seen corresponding path program 2 times [2020-04-17 22:51:46,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:46,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756921004] [2020-04-17 22:51:46,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:47,057 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-17 22:51:47,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756921004] [2020-04-17 22:51:47,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:47,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:47,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692742118] [2020-04-17 22:51:47,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:47,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:47,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:47,059 INFO L87 Difference]: Start difference. First operand 5986 states and 19163 transitions. Second operand 16 states. [2020-04-17 22:51:47,592 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-04-17 22:51:47,796 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-04-17 22:51:48,117 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-04-17 22:51:48,376 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-04-17 22:51:48,650 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2020-04-17 22:51:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:50,247 INFO L93 Difference]: Finished difference Result 7448 states and 23951 transitions. [2020-04-17 22:51:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:50,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:50,265 INFO L225 Difference]: With dead ends: 7448 [2020-04-17 22:51:50,265 INFO L226 Difference]: Without dead ends: 7448 [2020-04-17 22:51:50,266 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2020-04-17 22:51:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5180. [2020-04-17 22:51:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2020-04-17 22:51:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 16448 transitions. [2020-04-17 22:51:50,394 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 16448 transitions. Word has length 27 [2020-04-17 22:51:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:50,394 INFO L479 AbstractCegarLoop]: Abstraction has 5180 states and 16448 transitions. [2020-04-17 22:51:50,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 16448 transitions. [2020-04-17 22:51:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:50,399 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:50,401 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-17 22:51:50,401 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-17 22:51:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1764177885, now seen corresponding path program 4 times [2020-04-17 22:51:50,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:50,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304200654] [2020-04-17 22:51:50,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:51,064 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 33 [2020-04-17 22:51:51,297 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-17 22:51:51,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304200654] [2020-04-17 22:51:51,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:51,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:51,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43723050] [2020-04-17 22:51:51,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:51,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:51,300 INFO L87 Difference]: Start difference. First operand 5180 states and 16448 transitions. Second operand 16 states. [2020-04-17 22:51:52,657 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-04-17 22:51:53,078 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 22:51:53,303 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-04-17 22:51:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:54,716 INFO L93 Difference]: Finished difference Result 6661 states and 21391 transitions. [2020-04-17 22:51:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:51:54,717 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:54,727 INFO L225 Difference]: With dead ends: 6661 [2020-04-17 22:51:54,728 INFO L226 Difference]: Without dead ends: 6661 [2020-04-17 22:51:54,728 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2020-04-17 22:51:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-04-17 22:51:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5107. [2020-04-17 22:51:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2020-04-17 22:51:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 16229 transitions. [2020-04-17 22:51:54,808 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 16229 transitions. Word has length 27 [2020-04-17 22:51:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:54,808 INFO L479 AbstractCegarLoop]: Abstraction has 5107 states and 16229 transitions. [2020-04-17 22:51:54,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 16229 transitions. [2020-04-17 22:51:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:54,813 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:54,813 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-17 22:51:54,813 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-17 22:51:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash -4124945, now seen corresponding path program 5 times [2020-04-17 22:51:54,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:54,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233346924] [2020-04-17 22:51:54,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:55,405 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2020-04-17 22:51:55,711 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-17 22:51:55,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233346924] [2020-04-17 22:51:55,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:55,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:55,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370652666] [2020-04-17 22:51:55,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:55,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:55,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:55,713 INFO L87 Difference]: Start difference. First operand 5107 states and 16229 transitions. Second operand 17 states. [2020-04-17 22:51:57,149 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-04-17 22:51:57,352 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-04-17 22:51:57,533 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-04-17 22:51:57,743 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2020-04-17 22:51:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:59,019 INFO L93 Difference]: Finished difference Result 7607 states and 24383 transitions. [2020-04-17 22:51:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:59,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:51:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:59,033 INFO L225 Difference]: With dead ends: 7607 [2020-04-17 22:51:59,033 INFO L226 Difference]: Without dead ends: 7607 [2020-04-17 22:51:59,033 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2020-04-17 22:51:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2020-04-17 22:51:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 5296. [2020-04-17 22:51:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2020-04-17 22:51:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 16796 transitions. [2020-04-17 22:51:59,121 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 16796 transitions. Word has length 27 [2020-04-17 22:51:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:59,122 INFO L479 AbstractCegarLoop]: Abstraction has 5296 states and 16796 transitions. [2020-04-17 22:51:59,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:51:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 16796 transitions. [2020-04-17 22:51:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:59,126 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:59,127 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-17 22:51:59,127 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-17 22:51:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1451541601, now seen corresponding path program 6 times [2020-04-17 22:51:59,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:59,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687028173] [2020-04-17 22:51:59,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:59,667 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-04-17 22:51:59,898 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-17 22:51:59,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687028173] [2020-04-17 22:51:59,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:59,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116097934] [2020-04-17 22:51:59,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:59,900 INFO L87 Difference]: Start difference. First operand 5296 states and 16796 transitions. Second operand 15 states. [2020-04-17 22:52:01,016 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:52:01,292 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2020-04-17 22:52:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:02,886 INFO L93 Difference]: Finished difference Result 7946 states and 25504 transitions. [2020-04-17 22:52:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:52:02,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:52:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:02,900 INFO L225 Difference]: With dead ends: 7946 [2020-04-17 22:52:02,901 INFO L226 Difference]: Without dead ends: 7946 [2020-04-17 22:52:02,901 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:52:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2020-04-17 22:52:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 5044. [2020-04-17 22:52:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2020-04-17 22:52:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 16040 transitions. [2020-04-17 22:52:02,989 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 16040 transitions. Word has length 27 [2020-04-17 22:52:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:02,989 INFO L479 AbstractCegarLoop]: Abstraction has 5044 states and 16040 transitions. [2020-04-17 22:52:02,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:52:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 16040 transitions. [2020-04-17 22:52:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:02,995 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:02,996 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-17 22:52:02,996 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-17 22:52:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 902229065, now seen corresponding path program 7 times [2020-04-17 22:52:02,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:02,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436178790] [2020-04-17 22:52:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:03,596 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2020-04-17 22:52:03,729 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2020-04-17 22:52:03,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-17 22:52:03,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436178790] [2020-04-17 22:52:03,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:03,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:52:03,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454845076] [2020-04-17 22:52:03,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:52:03,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:52:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:52:03,898 INFO L87 Difference]: Start difference. First operand 5044 states and 16040 transitions. Second operand 16 states. [2020-04-17 22:52:05,577 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-04-17 22:52:05,772 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-04-17 22:52:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:06,877 INFO L93 Difference]: Finished difference Result 6570 states and 21263 transitions. [2020-04-17 22:52:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:52:06,877 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:52:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:06,888 INFO L225 Difference]: With dead ends: 6570 [2020-04-17 22:52:06,888 INFO L226 Difference]: Without dead ends: 6570 [2020-04-17 22:52:06,889 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:52:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6570 states. [2020-04-17 22:52:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6570 to 5501. [2020-04-17 22:52:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5501 states. [2020-04-17 22:52:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5501 states to 5501 states and 17636 transitions. [2020-04-17 22:52:06,983 INFO L78 Accepts]: Start accepts. Automaton has 5501 states and 17636 transitions. Word has length 27 [2020-04-17 22:52:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:06,983 INFO L479 AbstractCegarLoop]: Abstraction has 5501 states and 17636 transitions. [2020-04-17 22:52:06,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:52:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5501 states and 17636 transitions. [2020-04-17 22:52:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:06,988 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:06,988 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-17 22:52:06,989 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-17 22:52:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash 902229059, now seen corresponding path program 1 times [2020-04-17 22:52:06,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:06,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837857784] [2020-04-17 22:52:06,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:07,566 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-04-17 22:52:07,815 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-17 22:52:07,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837857784] [2020-04-17 22:52:07,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:07,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:52:07,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258115363] [2020-04-17 22:52:07,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:52:07,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:52:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:52:07,817 INFO L87 Difference]: Start difference. First operand 5501 states and 17636 transitions. Second operand 16 states. [2020-04-17 22:52:09,421 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-04-17 22:52:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:10,657 INFO L93 Difference]: Finished difference Result 6141 states and 19671 transitions. [2020-04-17 22:52:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:52:10,657 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:52:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:10,668 INFO L225 Difference]: With dead ends: 6141 [2020-04-17 22:52:10,669 INFO L226 Difference]: Without dead ends: 6141 [2020-04-17 22:52:10,669 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:52:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6141 states. [2020-04-17 22:52:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6141 to 5023. [2020-04-17 22:52:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2020-04-17 22:52:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 15977 transitions. [2020-04-17 22:52:10,747 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 15977 transitions. Word has length 27 [2020-04-17 22:52:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:10,747 INFO L479 AbstractCegarLoop]: Abstraction has 5023 states and 15977 transitions. [2020-04-17 22:52:10,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:52:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 15977 transitions. [2020-04-17 22:52:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:10,811 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:10,811 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-17 22:52:10,811 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-17 22:52:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1937071685, now seen corresponding path program 8 times [2020-04-17 22:52:10,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:10,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914088668] [2020-04-17 22:52:10,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:11,491 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-17 22:52:11,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914088668] [2020-04-17 22:52:11,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:11,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:52:11,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387504081] [2020-04-17 22:52:11,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:52:11,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:52:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:52:11,492 INFO L87 Difference]: Start difference. First operand 5023 states and 15977 transitions. Second operand 15 states. [2020-04-17 22:52:12,636 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:52:12,919 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2020-04-17 22:52:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:14,455 INFO L93 Difference]: Finished difference Result 7813 states and 25105 transitions. [2020-04-17 22:52:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:52:14,457 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:52:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:14,472 INFO L225 Difference]: With dead ends: 7813 [2020-04-17 22:52:14,473 INFO L226 Difference]: Without dead ends: 7813 [2020-04-17 22:52:14,473 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:52:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2020-04-17 22:52:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 4834. [2020-04-17 22:52:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2020-04-17 22:52:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 15410 transitions. [2020-04-17 22:52:14,567 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 15410 transitions. Word has length 27 [2020-04-17 22:52:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:14,567 INFO L479 AbstractCegarLoop]: Abstraction has 4834 states and 15410 transitions. [2020-04-17 22:52:14,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:52:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 15410 transitions. [2020-04-17 22:52:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:14,572 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:14,572 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-17 22:52:14,572 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-17 22:52:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash 495555017, now seen corresponding path program 9 times [2020-04-17 22:52:14,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:14,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880094215] [2020-04-17 22:52:14,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:15,004 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-04-17 22:52:15,298 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-17 22:52:15,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880094215] [2020-04-17 22:52:15,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:15,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:52:15,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497134642] [2020-04-17 22:52:15,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:52:15,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:15,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:52:15,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:52:15,300 INFO L87 Difference]: Start difference. First operand 4834 states and 15410 transitions. Second operand 15 states. [2020-04-17 22:52:16,330 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-04-17 22:52:16,591 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-04-17 22:52:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:18,513 INFO L93 Difference]: Finished difference Result 8170 states and 26657 transitions. [2020-04-17 22:52:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:18,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:52:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:18,530 INFO L225 Difference]: With dead ends: 8170 [2020-04-17 22:52:18,530 INFO L226 Difference]: Without dead ends: 8170 [2020-04-17 22:52:18,531 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:52:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2020-04-17 22:52:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5836. [2020-04-17 22:52:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5836 states. [2020-04-17 22:52:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5836 states to 5836 states and 18756 transitions. [2020-04-17 22:52:18,705 INFO L78 Accepts]: Start accepts. Automaton has 5836 states and 18756 transitions. Word has length 27 [2020-04-17 22:52:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:18,705 INFO L479 AbstractCegarLoop]: Abstraction has 5836 states and 18756 transitions. [2020-04-17 22:52:18,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:52:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5836 states and 18756 transitions. [2020-04-17 22:52:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:18,711 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:18,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-17 22:52:18,711 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-17 22:52:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 495555011, now seen corresponding path program 2 times [2020-04-17 22:52:18,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:18,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056887143] [2020-04-17 22:52:18,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:19,159 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2020-04-17 22:52:19,384 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-17 22:52:19,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056887143] [2020-04-17 22:52:19,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:19,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:52:19,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273961973] [2020-04-17 22:52:19,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:52:19,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:52:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:52:19,386 INFO L87 Difference]: Start difference. First operand 5836 states and 18756 transitions. Second operand 15 states. [2020-04-17 22:52:20,533 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-04-17 22:52:20,815 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2020-04-17 22:52:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:22,855 INFO L93 Difference]: Finished difference Result 8170 states and 26512 transitions. [2020-04-17 22:52:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:22,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:52:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:22,868 INFO L225 Difference]: With dead ends: 8170 [2020-04-17 22:52:22,868 INFO L226 Difference]: Without dead ends: 8170 [2020-04-17 22:52:22,869 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:52:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2020-04-17 22:52:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 4886. [2020-04-17 22:52:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2020-04-17 22:52:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 15577 transitions. [2020-04-17 22:52:22,952 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 15577 transitions. Word has length 27 [2020-04-17 22:52:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:22,952 INFO L479 AbstractCegarLoop]: Abstraction has 4886 states and 15577 transitions. [2020-04-17 22:52:22,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:52:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 15577 transitions. [2020-04-17 22:52:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:22,956 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:22,956 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-17 22:52:22,957 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-17 22:52:22,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1660385861, now seen corresponding path program 10 times [2020-04-17 22:52:22,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:22,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235663009] [2020-04-17 22:52:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:23,452 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2020-04-17 22:52:23,665 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-17 22:52:23,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235663009] [2020-04-17 22:52:23,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:23,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:52:23,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213086117] [2020-04-17 22:52:23,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:52:23,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:23,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:52:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:52:23,667 INFO L87 Difference]: Start difference. First operand 4886 states and 15577 transitions. Second operand 15 states. [2020-04-17 22:52:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:26,495 INFO L93 Difference]: Finished difference Result 6800 states and 21913 transitions. [2020-04-17 22:52:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:52:26,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:52:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:26,507 INFO L225 Difference]: With dead ends: 6800 [2020-04-17 22:52:26,508 INFO L226 Difference]: Without dead ends: 6800 [2020-04-17 22:52:26,508 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:52:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2020-04-17 22:52:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 4676. [2020-04-17 22:52:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2020-04-17 22:52:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 14927 transitions. [2020-04-17 22:52:26,593 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 14927 transitions. Word has length 27 [2020-04-17 22:52:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:26,593 INFO L479 AbstractCegarLoop]: Abstraction has 4676 states and 14927 transitions. [2020-04-17 22:52:26,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:52:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 14927 transitions. [2020-04-17 22:52:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:26,598 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:26,598 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-17 22:52:26,598 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-17 22:52:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -783135897, now seen corresponding path program 4 times [2020-04-17 22:52:26,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:26,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374983379] [2020-04-17 22:52:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:27,378 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-17 22:52:27,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374983379] [2020-04-17 22:52:27,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:27,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:27,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745965263] [2020-04-17 22:52:27,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:27,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:27,380 INFO L87 Difference]: Start difference. First operand 4676 states and 14927 transitions. Second operand 17 states. [2020-04-17 22:52:28,920 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-04-17 22:52:29,128 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2020-04-17 22:52:29,466 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-04-17 22:52:29,696 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-04-17 22:52:29,949 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2020-04-17 22:52:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:31,547 INFO L93 Difference]: Finished difference Result 6234 states and 20246 transitions. [2020-04-17 22:52:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:31,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:52:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:31,558 INFO L225 Difference]: With dead ends: 6234 [2020-04-17 22:52:31,559 INFO L226 Difference]: Without dead ends: 6234 [2020-04-17 22:52:31,559 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-17 22:52:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-04-17 22:52:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5164. [2020-04-17 22:52:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2020-04-17 22:52:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 16616 transitions. [2020-04-17 22:52:31,633 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 16616 transitions. Word has length 27 [2020-04-17 22:52:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:31,633 INFO L479 AbstractCegarLoop]: Abstraction has 5164 states and 16616 transitions. [2020-04-17 22:52:31,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 16616 transitions. [2020-04-17 22:52:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:31,638 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:31,639 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-17 22:52:31,639 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-17 22:52:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash -783135903, now seen corresponding path program 3 times [2020-04-17 22:52:31,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:31,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528242398] [2020-04-17 22:52:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:32,409 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2020-04-17 22:52:32,797 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-17 22:52:32,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528242398] [2020-04-17 22:52:32,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:32,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:32,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854161176] [2020-04-17 22:52:32,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:32,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:32,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:32,800 INFO L87 Difference]: Start difference. First operand 5164 states and 16616 transitions. Second operand 17 states. [2020-04-17 22:52:34,108 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-17 22:52:34,308 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-04-17 22:52:34,610 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2020-04-17 22:52:34,844 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-04-17 22:52:35,103 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-04-17 22:52:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:36,406 INFO L93 Difference]: Finished difference Result 6234 states and 20101 transitions. [2020-04-17 22:52:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:36,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:52:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:36,417 INFO L225 Difference]: With dead ends: 6234 [2020-04-17 22:52:36,418 INFO L226 Difference]: Without dead ends: 6234 [2020-04-17 22:52:36,418 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:52:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-04-17 22:52:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 4670. [2020-04-17 22:52:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2020-04-17 22:52:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 14909 transitions. [2020-04-17 22:52:36,495 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 14909 transitions. Word has length 27 [2020-04-17 22:52:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:36,495 INFO L479 AbstractCegarLoop]: Abstraction has 4670 states and 14909 transitions. [2020-04-17 22:52:36,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 14909 transitions. [2020-04-17 22:52:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:36,499 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:36,500 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-17 22:52:36,500 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-17 22:52:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1974887137, now seen corresponding path program 5 times [2020-04-17 22:52:36,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:36,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508342478] [2020-04-17 22:52:36,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:37,135 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2020-04-17 22:52:37,333 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-17 22:52:37,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508342478] [2020-04-17 22:52:37,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:37,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:37,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955711254] [2020-04-17 22:52:37,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:37,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:37,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:37,334 INFO L87 Difference]: Start difference. First operand 4670 states and 14909 transitions. Second operand 17 states. [2020-04-17 22:52:38,791 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2020-04-17 22:52:38,956 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-04-17 22:52:39,211 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-04-17 22:52:39,398 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-04-17 22:52:39,629 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2020-04-17 22:52:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:41,093 INFO L93 Difference]: Finished difference Result 7210 states and 23328 transitions. [2020-04-17 22:52:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:41,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:52:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:41,108 INFO L225 Difference]: With dead ends: 7210 [2020-04-17 22:52:41,108 INFO L226 Difference]: Without dead ends: 7210 [2020-04-17 22:52:41,109 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:52:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7210 states. [2020-04-17 22:52:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7210 to 5206. [2020-04-17 22:52:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5206 states. [2020-04-17 22:52:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 16742 transitions. [2020-04-17 22:52:41,208 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 16742 transitions. Word has length 27 [2020-04-17 22:52:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:41,208 INFO L479 AbstractCegarLoop]: Abstraction has 5206 states and 16742 transitions. [2020-04-17 22:52:41,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 16742 transitions. [2020-04-17 22:52:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:41,214 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:41,214 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-17 22:52:41,214 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-17 22:52:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1974887131, now seen corresponding path program 4 times [2020-04-17 22:52:41,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:41,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387123462] [2020-04-17 22:52:41,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:41,954 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-17 22:52:41,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387123462] [2020-04-17 22:52:41,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:41,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:41,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411356905] [2020-04-17 22:52:41,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:41,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:41,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:41,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:41,955 INFO L87 Difference]: Start difference. First operand 5206 states and 16742 transitions. Second operand 17 states. [2020-04-17 22:52:43,511 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2020-04-17 22:52:43,688 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-04-17 22:52:43,977 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2020-04-17 22:52:44,182 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-04-17 22:52:44,447 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2020-04-17 22:52:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:45,842 INFO L93 Difference]: Finished difference Result 6781 states and 21736 transitions. [2020-04-17 22:52:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:45,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:52:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:45,856 INFO L225 Difference]: With dead ends: 6781 [2020-04-17 22:52:45,856 INFO L226 Difference]: Without dead ends: 6781 [2020-04-17 22:52:45,856 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-17 22:52:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2020-04-17 22:52:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 4724. [2020-04-17 22:52:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2020-04-17 22:52:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 15071 transitions. [2020-04-17 22:52:45,942 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 15071 transitions. Word has length 27 [2020-04-17 22:52:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:45,942 INFO L479 AbstractCegarLoop]: Abstraction has 4724 states and 15071 transitions. [2020-04-17 22:52:45,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 15071 transitions. [2020-04-17 22:52:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:45,946 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:45,947 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-17 22:52:45,947 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-17 22:52:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash 552992441, now seen corresponding path program 6 times [2020-04-17 22:52:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:45,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418589951] [2020-04-17 22:52:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:46,744 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-17 22:52:46,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418589951] [2020-04-17 22:52:46,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:46,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:52:46,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501602511] [2020-04-17 22:52:46,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:52:46,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:52:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:52:46,746 INFO L87 Difference]: Start difference. First operand 4724 states and 15071 transitions. Second operand 16 states. [2020-04-17 22:52:47,390 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-04-17 22:52:47,607 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 22:52:47,984 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:52:48,257 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:52:48,583 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 22:52:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:50,453 INFO L93 Difference]: Finished difference Result 7546 states and 24440 transitions. [2020-04-17 22:52:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:52:50,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:52:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:50,466 INFO L225 Difference]: With dead ends: 7546 [2020-04-17 22:52:50,466 INFO L226 Difference]: Without dead ends: 7546 [2020-04-17 22:52:50,466 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:52:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2020-04-17 22:52:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5914. [2020-04-17 22:52:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5914 states. [2020-04-17 22:52:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 18970 transitions. [2020-04-17 22:52:50,559 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 18970 transitions. Word has length 27 [2020-04-17 22:52:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:50,559 INFO L479 AbstractCegarLoop]: Abstraction has 5914 states and 18970 transitions. [2020-04-17 22:52:50,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:52:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 18970 transitions. [2020-04-17 22:52:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:50,564 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:50,564 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-17 22:52:50,564 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-17 22:52:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash 552992435, now seen corresponding path program 5 times [2020-04-17 22:52:50,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:50,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284674259] [2020-04-17 22:52:50,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:51,229 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-17 22:52:51,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284674259] [2020-04-17 22:52:51,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:51,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:52:51,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729839553] [2020-04-17 22:52:51,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:52:51,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:52:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:52:51,230 INFO L87 Difference]: Start difference. First operand 5914 states and 18970 transitions. Second operand 16 states. [2020-04-17 22:52:52,306 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-17 22:52:52,856 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-17 22:52:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:54,511 INFO L93 Difference]: Finished difference Result 7117 states and 22848 transitions. [2020-04-17 22:52:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:52:54,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:52:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:54,522 INFO L225 Difference]: With dead ends: 7117 [2020-04-17 22:52:54,522 INFO L226 Difference]: Without dead ends: 7117 [2020-04-17 22:52:54,522 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:52:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2020-04-17 22:52:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 4616. [2020-04-17 22:52:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4616 states. [2020-04-17 22:52:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 14747 transitions. [2020-04-17 22:52:54,597 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 14747 transitions. Word has length 27 [2020-04-17 22:52:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:54,598 INFO L479 AbstractCegarLoop]: Abstraction has 4616 states and 14747 transitions. [2020-04-17 22:52:54,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:52:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 14747 transitions. [2020-04-17 22:52:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:54,601 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:54,601 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-17 22:52:54,602 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-17 22:52:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1110689729, now seen corresponding path program 7 times [2020-04-17 22:52:54,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:54,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450171602] [2020-04-17 22:52:54,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:55,281 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2020-04-17 22:52:55,504 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-17 22:52:55,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450171602] [2020-04-17 22:52:55,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:55,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:55,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942171989] [2020-04-17 22:52:55,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:55,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:55,506 INFO L87 Difference]: Start difference. First operand 4616 states and 14747 transitions. Second operand 17 states. [2020-04-17 22:52:56,881 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-04-17 22:52:57,050 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-04-17 22:52:57,301 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-04-17 22:52:57,493 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-04-17 22:52:57,729 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-04-17 22:52:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:59,108 INFO L93 Difference]: Finished difference Result 6084 states and 19796 transitions. [2020-04-17 22:52:59,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:59,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:52:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:59,120 INFO L225 Difference]: With dead ends: 6084 [2020-04-17 22:52:59,120 INFO L226 Difference]: Without dead ends: 6084 [2020-04-17 22:52:59,121 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:52:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-04-17 22:52:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 5026. [2020-04-17 22:52:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5026 states. [2020-04-17 22:52:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 16202 transitions. [2020-04-17 22:52:59,200 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 16202 transitions. Word has length 27 [2020-04-17 22:52:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:59,200 INFO L479 AbstractCegarLoop]: Abstraction has 5026 states and 16202 transitions. [2020-04-17 22:52:59,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 16202 transitions. [2020-04-17 22:52:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:52:59,205 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:59,205 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-17 22:52:59,205 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-17 22:52:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1110689723, now seen corresponding path program 6 times [2020-04-17 22:52:59,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:59,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474112404] [2020-04-17 22:52:59,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:59,954 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-04-17 22:53:00,195 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-17 22:53:00,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474112404] [2020-04-17 22:53:00,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:00,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:53:00,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407146102] [2020-04-17 22:53:00,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:53:00,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:53:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:53:00,198 INFO L87 Difference]: Start difference. First operand 5026 states and 16202 transitions. Second operand 17 states. [2020-04-17 22:53:00,653 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-04-17 22:53:01,686 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-04-17 22:53:01,849 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:53:02,103 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-04-17 22:53:02,293 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-04-17 22:53:02,529 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-04-17 22:53:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:03,878 INFO L93 Difference]: Finished difference Result 5655 states and 18204 transitions. [2020-04-17 22:53:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:53:03,879 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:53:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:03,887 INFO L225 Difference]: With dead ends: 5655 [2020-04-17 22:53:03,888 INFO L226 Difference]: Without dead ends: 5655 [2020-04-17 22:53:03,888 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:53:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2020-04-17 22:53:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 4544. [2020-04-17 22:53:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2020-04-17 22:53:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 14531 transitions. [2020-04-17 22:53:03,962 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 14531 transitions. Word has length 27 [2020-04-17 22:53:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:03,962 INFO L479 AbstractCegarLoop]: Abstraction has 4544 states and 14531 transitions. [2020-04-17 22:53:03,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:53:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 14531 transitions. [2020-04-17 22:53:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:03,967 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:03,968 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-17 22:53:03,968 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-17 22:53:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash -311204967, now seen corresponding path program 8 times [2020-04-17 22:53:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:03,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54598865] [2020-04-17 22:53:03,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:04,613 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2020-04-17 22:53:04,978 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-17 22:53:04,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54598865] [2020-04-17 22:53:04,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:04,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:53:04,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748204015] [2020-04-17 22:53:04,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:53:04,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:53:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:53:04,981 INFO L87 Difference]: Start difference. First operand 4544 states and 14531 transitions. Second operand 16 states. [2020-04-17 22:53:05,761 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 22:53:06,133 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:53:06,399 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:53:06,717 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 22:53:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:08,516 INFO L93 Difference]: Finished difference Result 7354 states and 23864 transitions. [2020-04-17 22:53:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:53:08,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:53:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:08,531 INFO L225 Difference]: With dead ends: 7354 [2020-04-17 22:53:08,532 INFO L226 Difference]: Without dead ends: 7354 [2020-04-17 22:53:08,532 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:53:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7354 states. [2020-04-17 22:53:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7354 to 5734. [2020-04-17 22:53:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2020-04-17 22:53:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 18430 transitions. [2020-04-17 22:53:08,638 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 18430 transitions. Word has length 27 [2020-04-17 22:53:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:08,638 INFO L479 AbstractCegarLoop]: Abstraction has 5734 states and 18430 transitions. [2020-04-17 22:53:08,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:53:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 18430 transitions. [2020-04-17 22:53:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:08,644 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:08,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, 1, 1] [2020-04-17 22:53:08,644 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-17 22:53:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -311204973, now seen corresponding path program 7 times [2020-04-17 22:53:08,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:08,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845878693] [2020-04-17 22:53:08,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:09,470 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-17 22:53:09,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845878693] [2020-04-17 22:53:09,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:09,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:53:09,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441428442] [2020-04-17 22:53:09,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:53:09,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:09,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:53:09,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:53:09,473 INFO L87 Difference]: Start difference. First operand 5734 states and 18430 transitions. Second operand 16 states. [2020-04-17 22:53:10,558 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-17 22:53:10,847 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-04-17 22:53:11,172 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-17 22:53:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:12,868 INFO L93 Difference]: Finished difference Result 6925 states and 22272 transitions. [2020-04-17 22:53:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:53:12,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:53:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:12,881 INFO L225 Difference]: With dead ends: 6925 [2020-04-17 22:53:12,881 INFO L226 Difference]: Without dead ends: 6925 [2020-04-17 22:53:12,882 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:53:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2020-04-17 22:53:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 4490. [2020-04-17 22:53:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4490 states. [2020-04-17 22:53:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 14369 transitions. [2020-04-17 22:53:13,040 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 14369 transitions. Word has length 27 [2020-04-17 22:53:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:13,040 INFO L479 AbstractCegarLoop]: Abstraction has 4490 states and 14369 transitions. [2020-04-17 22:53:13,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:53:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 14369 transitions. [2020-04-17 22:53:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:13,044 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:13,044 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-17 22:53:13,045 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-17 22:53:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:13,045 INFO L82 PathProgramCache]: Analyzing trace with hash 190808577, now seen corresponding path program 9 times [2020-04-17 22:53:13,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:13,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268104035] [2020-04-17 22:53:13,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:13,826 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2020-04-17 22:53:14,139 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-17 22:53:14,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268104035] [2020-04-17 22:53:14,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:14,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-17 22:53:14,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282556997] [2020-04-17 22:53:14,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:53:14,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:53:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:53:14,141 INFO L87 Difference]: Start difference. First operand 4490 states and 14369 transitions. Second operand 19 states. [2020-04-17 22:53:15,094 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 22:53:16,347 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 22:53:16,579 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 22:53:16,760 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-04-17 22:53:16,981 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-04-17 22:53:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:18,542 INFO L93 Difference]: Finished difference Result 6183 states and 20016 transitions. [2020-04-17 22:53:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:53:18,542 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-04-17 22:53:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:18,555 INFO L225 Difference]: With dead ends: 6183 [2020-04-17 22:53:18,555 INFO L226 Difference]: Without dead ends: 6183 [2020-04-17 22:53:18,556 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2020-04-17 22:53:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2020-04-17 22:53:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 5056. [2020-04-17 22:53:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5056 states. [2020-04-17 22:53:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 16292 transitions. [2020-04-17 22:53:18,697 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 16292 transitions. Word has length 27 [2020-04-17 22:53:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:18,698 INFO L479 AbstractCegarLoop]: Abstraction has 5056 states and 16292 transitions. [2020-04-17 22:53:18,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:53:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 16292 transitions. [2020-04-17 22:53:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:18,702 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:18,702 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-17 22:53:18,702 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-17 22:53:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 190808571, now seen corresponding path program 8 times [2020-04-17 22:53:18,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:18,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051793021] [2020-04-17 22:53:18,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:19,438 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-17 22:53:19,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051793021] [2020-04-17 22:53:19,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:19,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:53:19,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317508277] [2020-04-17 22:53:19,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:53:19,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:53:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:53:19,439 INFO L87 Difference]: Start difference. First operand 5056 states and 16292 transitions. Second operand 17 states. [2020-04-17 22:53:20,282 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 22:53:20,649 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:53:20,914 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 22:53:21,252 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-04-17 22:53:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:22,830 INFO L93 Difference]: Finished difference Result 6775 states and 21967 transitions. [2020-04-17 22:53:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:53:22,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:53:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:22,842 INFO L225 Difference]: With dead ends: 6775 [2020-04-17 22:53:22,842 INFO L226 Difference]: Without dead ends: 6775 [2020-04-17 22:53:22,842 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:53:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6775 states. [2020-04-17 22:53:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6775 to 5608. [2020-04-17 22:53:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5608 states. [2020-04-17 22:53:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 18052 transitions. [2020-04-17 22:53:22,927 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 18052 transitions. Word has length 27 [2020-04-17 22:53:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:22,928 INFO L479 AbstractCegarLoop]: Abstraction has 5608 states and 18052 transitions. [2020-04-17 22:53:22,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:53:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 18052 transitions. [2020-04-17 22:53:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:22,933 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:22,933 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-17 22:53:22,933 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-17 22:53:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1922106729, now seen corresponding path program 10 times [2020-04-17 22:53:22,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:22,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207816419] [2020-04-17 22:53:22,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:23,660 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-17 22:53:23,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207816419] [2020-04-17 22:53:23,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:23,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:53:23,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796004808] [2020-04-17 22:53:23,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:53:23,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:53:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:53:23,661 INFO L87 Difference]: Start difference. First operand 5608 states and 18052 transitions. Second operand 17 states. [2020-04-17 22:53:25,510 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 22:53:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:27,256 INFO L93 Difference]: Finished difference Result 7204 states and 23269 transitions. [2020-04-17 22:53:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:53:27,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 22:53:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:27,270 INFO L225 Difference]: With dead ends: 7204 [2020-04-17 22:53:27,270 INFO L226 Difference]: Without dead ends: 7204 [2020-04-17 22:53:27,270 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:53:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2020-04-17 22:53:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 4310. [2020-04-17 22:53:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4310 states. [2020-04-17 22:53:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 13829 transitions. [2020-04-17 22:53:27,354 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 13829 transitions. Word has length 27 [2020-04-17 22:53:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:27,354 INFO L479 AbstractCegarLoop]: Abstraction has 4310 states and 13829 transitions. [2020-04-17 22:53:27,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:53:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 13829 transitions. [2020-04-17 22:53:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:27,358 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:27,358 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-17 22:53:27,358 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-17 22:53:27,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722431, now seen corresponding path program 11 times [2020-04-17 22:53:27,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:27,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265686627] [2020-04-17 22:53:27,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:27,830 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2020-04-17 22:53:27,962 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2020-04-17 22:53:28,248 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-17 22:53:28,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265686627] [2020-04-17 22:53:28,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:28,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 22:53:28,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106509817] [2020-04-17 22:53:28,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 22:53:28,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:28,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 22:53:28,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:53:28,250 INFO L87 Difference]: Start difference. First operand 4310 states and 13829 transitions. Second operand 18 states. [2020-04-17 22:53:30,856 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:53:31,319 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-04-17 22:53:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:32,584 INFO L93 Difference]: Finished difference Result 6394 states and 20847 transitions. [2020-04-17 22:53:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:53:32,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-17 22:53:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:32,596 INFO L225 Difference]: With dead ends: 6394 [2020-04-17 22:53:32,597 INFO L226 Difference]: Without dead ends: 6394 [2020-04-17 22:53:32,597 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2020-04-17 22:53:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2020-04-17 22:53:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 5260. [2020-04-17 22:53:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2020-04-17 22:53:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 17008 transitions. [2020-04-17 22:53:32,678 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 17008 transitions. Word has length 27 [2020-04-17 22:53:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:32,678 INFO L479 AbstractCegarLoop]: Abstraction has 5260 states and 17008 transitions. [2020-04-17 22:53:32,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 22:53:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 17008 transitions. [2020-04-17 22:53:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:32,682 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:32,682 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-17 22:53:32,682 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-17 22:53:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:32,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722437, now seen corresponding path program 9 times [2020-04-17 22:53:32,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:32,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444335643] [2020-04-17 22:53:32,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:33,065 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2020-04-17 22:53:33,222 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2020-04-17 22:53:33,636 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-17 22:53:33,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444335643] [2020-04-17 22:53:33,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:33,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 22:53:33,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456443820] [2020-04-17 22:53:33,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 22:53:33,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:33,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 22:53:33,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:53:33,638 INFO L87 Difference]: Start difference. First operand 5260 states and 17008 transitions. Second operand 18 states. [2020-04-17 22:53:34,688 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-17 22:53:35,976 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:53:36,285 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-04-17 22:53:36,497 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-04-17 22:53:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:37,674 INFO L93 Difference]: Finished difference Result 5965 states and 19255 transitions. [2020-04-17 22:53:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:53:37,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-17 22:53:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:37,686 INFO L225 Difference]: With dead ends: 5965 [2020-04-17 22:53:37,686 INFO L226 Difference]: Without dead ends: 5965 [2020-04-17 22:53:37,687 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2020-04-17 22:53:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-04-17 22:53:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 4250. [2020-04-17 22:53:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4250 states. [2020-04-17 22:53:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 13649 transitions. [2020-04-17 22:53:37,760 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 13649 transitions. Word has length 27 [2020-04-17 22:53:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:37,760 INFO L479 AbstractCegarLoop]: Abstraction has 4250 states and 13649 transitions. [2020-04-17 22:53:37,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 22:53:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 13649 transitions. [2020-04-17 22:53:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:53:37,764 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:37,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-17 22:53:37,764 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-17 22:53:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash 147907303, now seen corresponding path program 12 times [2020-04-17 22:53:37,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:37,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234562494] [2020-04-17 22:53:37,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-04-17 22:53:37,846 WARN L209 SmtUtils]: Removed 7 from assertion stack [2020-04-17 22:53:37,846 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-17 22:53:37,850 WARN L228 ceAbstractionStarter]: Timeout [2020-04-17 22:53:37,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.04 10:53:37 BasicIcfg [2020-04-17 22:53:37,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-17 22:53:37,857 INFO L168 Benchmark]: Toolchain (without parser) took 235021.49 ms. Allocated memory was 135.3 MB in the beginning and 1.1 GB in the end (delta: 958.4 MB). Free memory was 97.5 MB in the beginning and 752.5 MB in the end (delta: -655.0 MB). Peak memory consumption was 303.4 MB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,858 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1038.52 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 95.4 MB in the beginning and 119.6 MB in the end (delta: -24.1 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.13 ms. Allocated memory is still 199.8 MB. Free memory was 119.6 MB in the beginning and 116.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,862 INFO L168 Benchmark]: Boogie Preprocessor took 78.86 ms. Allocated memory is still 199.8 MB. Free memory was 116.7 MB in the beginning and 114.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,862 INFO L168 Benchmark]: RCFGBuilder took 776.04 ms. Allocated memory was 199.8 MB in the beginning and 227.0 MB in the end (delta: 27.3 MB). Free memory was 114.5 MB in the beginning and 188.6 MB in the end (delta: -74.1 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,863 INFO L168 Benchmark]: TraceAbstraction took 232984.20 ms. Allocated memory was 227.0 MB in the beginning and 1.1 GB in the end (delta: 866.6 MB). Free memory was 188.6 MB in the beginning and 752.5 MB in the end (delta: -563.9 MB). Peak memory consumption was 302.8 MB. Max. memory is 7.1 GB. [2020-04-17 22:53:37,865 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.50 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1038.52 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 95.4 MB in the beginning and 119.6 MB in the end (delta: -24.1 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 115.13 ms. Allocated memory is still 199.8 MB. Free memory was 119.6 MB in the beginning and 116.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.86 ms. Allocated memory is still 199.8 MB. Free memory was 116.7 MB in the beginning and 114.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.04 ms. Allocated memory was 199.8 MB in the beginning and 227.0 MB in the end (delta: 27.3 MB). Free memory was 114.5 MB in the beginning and 188.6 MB in the end (delta: -74.1 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232984.20 ms. Allocated memory was 227.0 MB in the beginning and 1.1 GB in the end (delta: 866.6 MB). Free memory was 188.6 MB in the beginning and 752.5 MB in the end (delta: -563.9 MB). Peak memory consumption was 302.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 189 ProgramPointsBefore, 60 ProgramPointsAfterwards, 201 TransitionsBefore, 65 TransitionsAfterwards, 16584 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 7 ChoiceCompositions, 8663 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 267 SemBasedMoverChecksPositive, 138 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 27423 CheckedPairsTotal, 166 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 10ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 10ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 10ms.. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 232.7s, OverallIterations: 64, TraceHistogramMax: 1, AutomataDifference: 178.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 3913 SDtfs, 15780 SDslu, 16389 SDs, 0 SdLazy, 95677 SolverSat, 1397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1577 GetRequests, 45 SyntacticMatches, 34 SemanticMatches, 1498 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4768 ImplicationChecksByTransitivity, 94.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5986occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 63 MinimizatonAttempts, 71934 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 39.6s InterpolantComputationTime, 1617 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1554 ConstructedInterpolants, 0 QuantifiedInterpolants, 1098217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 63 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