/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:08:45,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:08:45,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:08:45,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:08:45,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:08:45,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:08:45,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:08:45,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:08:45,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:08:45,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:08:45,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:08:45,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:08:45,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:08:45,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:08:45,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:08:45,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:08:45,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:08:45,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:08:45,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:08:45,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:08:45,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:08:45,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:08:45,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:08:45,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:08:45,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:08:45,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:08:45,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:08:45,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:08:45,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:08:45,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:08:45,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:08:45,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:08:45,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:08:45,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:08:45,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:08:45,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:08:45,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:08:45,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:08:45,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:08:45,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:08:45,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:08:45,973 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-MCR.epf [2019-12-27 19:08:45,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:08:45,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:08:45,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:08:45,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:08:45,989 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:08:45,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:08:45,989 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:08:45,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:08:45,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:08:45,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:08:45,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:08:45,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:08:45,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:08:45,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:08:45,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:08:45,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:08:45,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:08:45,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:08:45,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:08:45,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:08:45,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:08:45,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:08:45,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:08:45,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:08:45,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:08:45,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:08:45,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:08:45,993 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:08:45,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:08:45,993 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:08:45,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:08:46,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:08:46,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:08:46,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:08:46,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:08:46,311 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:08:46,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 19:08:46,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e243da265/da8ac4eb7b4b423f94a025f198590197/FLAG8fca43373 [2019-12-27 19:08:46,952 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:08:46,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2019-12-27 19:08:46,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e243da265/da8ac4eb7b4b423f94a025f198590197/FLAG8fca43373 [2019-12-27 19:08:47,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e243da265/da8ac4eb7b4b423f94a025f198590197 [2019-12-27 19:08:47,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:08:47,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:08:47,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:08:47,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:08:47,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:08:47,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:47" (1/1) ... [2019-12-27 19:08:47,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8a0557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:47, skipping insertion in model container [2019-12-27 19:08:47,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:47" (1/1) ... [2019-12-27 19:08:47,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:08:47,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:08:47,470 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 19:08:48,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:08:48,016 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:08:48,041 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 19:08:48,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:08:48,281 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:08:48,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48 WrapperNode [2019-12-27 19:08:48,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:08:48,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:08:48,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:08:48,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:08:48,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:08:48,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:08:48,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:08:48,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:08:48,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... [2019-12-27 19:08:48,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:08:48,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:08:48,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:08:48,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:08:48,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:08:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2019-12-27 19:08:48,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2019-12-27 19:08:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2019-12-27 19:08:48,478 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2019-12-27 19:08:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:08:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:08:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 19:08:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:08:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 19:08:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:08:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:08:48,481 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:08:49,165 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:08:49,165 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-27 19:08:49,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:49 BoogieIcfgContainer [2019-12-27 19:08:49,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:08:49,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:08:49,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:08:49,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:08:49,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:08:47" (1/3) ... [2019-12-27 19:08:49,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf7dff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:49, skipping insertion in model container [2019-12-27 19:08:49,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:48" (2/3) ... [2019-12-27 19:08:49,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf7dff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:49, skipping insertion in model container [2019-12-27 19:08:49,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:49" (3/3) ... [2019-12-27 19:08:49,186 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2019-12-27 19:08:49,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:08:49,197 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:08:49,205 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-27 19:08:49,206 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:08:49,246 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,247 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,247 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,248 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,248 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,248 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,248 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,249 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,250 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,250 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,250 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,250 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,250 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,251 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,252 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,252 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,253 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,253 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,253 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,254 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,254 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,255 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,255 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,255 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,255 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,255 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,255 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,256 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,256 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,256 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,256 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,256 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,257 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,257 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,257 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,257 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,257 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,257 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,258 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,258 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,258 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,259 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,259 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,259 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,259 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,259 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,260 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,260 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,260 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,260 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,260 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,260 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,261 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,261 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,261 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,261 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,261 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,262 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,262 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,262 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,262 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,262 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,262 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,263 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,263 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,263 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,263 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,263 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,264 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,264 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,264 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,264 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,264 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,265 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,265 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,265 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,265 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,265 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,266 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,266 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,266 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,266 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,267 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,267 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,267 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,267 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,267 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,268 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,268 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,268 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,268 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,268 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,269 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,269 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,269 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,269 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,270 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,270 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,270 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,270 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,270 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,271 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,271 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,271 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,271 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,271 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,272 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,272 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,272 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,272 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,273 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,273 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,273 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,273 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,274 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,274 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,274 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,275 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,275 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,275 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,275 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,276 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,277 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,277 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,277 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,277 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,277 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,278 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,278 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,278 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,279 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,279 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,279 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,279 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,279 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,280 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,280 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,280 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,280 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,280 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,281 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,281 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,281 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,281 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,281 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,282 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,282 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,282 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,282 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,282 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,282 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,283 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,283 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,283 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,283 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,283 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,284 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,284 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,285 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,285 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,285 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,285 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,286 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,286 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,286 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,286 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,286 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,286 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,287 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,287 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,287 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,287 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,288 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,288 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,288 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,288 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,288 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,288 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,289 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,289 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,289 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,289 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,289 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,290 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,290 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,290 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,290 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,290 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,291 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,294 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,295 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,295 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,295 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,295 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,296 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,296 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,296 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,296 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,296 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,297 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,297 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,297 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,297 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,297 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,298 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,298 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,298 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,311 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,311 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,311 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,311 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,312 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,312 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,312 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,312 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,312 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,313 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,314 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,314 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,314 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,315 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,315 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,315 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,315 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,315 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,316 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,316 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,316 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,316 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,316 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,317 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,317 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,317 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,317 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,317 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,317 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,318 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,318 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,318 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,319 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,319 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,319 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:08:49,345 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-27 19:08:49,369 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:08:49,369 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:08:49,369 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:08:49,369 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:08:49,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:08:49,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:08:49,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:08:49,370 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:08:49,395 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions [2019-12-27 19:08:49,401 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 19:08:49,502 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 19:08:49,503 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 19:08:49,517 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-27 19:08:49,541 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions [2019-12-27 19:08:49,593 INFO L132 PetriNetUnfolder]: 18/189 cut-off events. [2019-12-27 19:08:49,593 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 19:08:49,600 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2019-12-27 19:08:49,620 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2019-12-27 19:08:49,621 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:08:50,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:50,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:50,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:50,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:50,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:50,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:50,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:52,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:52,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:52,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:52,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:52,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:52,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:08:53,784 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-27 19:08:54,397 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20924 [2019-12-27 19:08:54,398 INFO L214 etLargeBlockEncoding]: Total number of compositions: 153 [2019-12-27 19:08:54,403 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 65 transitions [2019-12-27 19:08:54,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2019-12-27 19:08:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2019-12-27 19:08:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:08:54,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:54,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:08:54,579 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash -437483837, now seen corresponding path program 1 times [2019-12-27 19:08:54,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:54,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154714752] [2019-12-27 19:08:54,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:08:55,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154714752] [2019-12-27 19:08:55,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:55,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:08:55,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [177840399] [2019-12-27 19:08:55,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:55,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:55,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:08:55,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:55,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:08:55,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:08:55,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:08:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:08:55,232 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2019-12-27 19:08:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:55,610 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2019-12-27 19:08:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:08:55,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 19:08:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:55,659 INFO L225 Difference]: With dead ends: 2169 [2019-12-27 19:08:55,660 INFO L226 Difference]: Without dead ends: 2053 [2019-12-27 19:08:55,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:08:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-27 19:08:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-27 19:08:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-27 19:08:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2019-12-27 19:08:55,857 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2019-12-27 19:08:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:55,857 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2019-12-27 19:08:55,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:08:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2019-12-27 19:08:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:08:55,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:55,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:08:55,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -357357885, now seen corresponding path program 1 times [2019-12-27 19:08:55,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:55,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182199265] [2019-12-27 19:08:55,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:08:56,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182199265] [2019-12-27 19:08:56,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:56,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:08:56,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336984659] [2019-12-27 19:08:56,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:56,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:56,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 19:08:56,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:56,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:08:56,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:08:56,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:08:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:08:56,154 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2019-12-27 19:08:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:56,808 INFO L93 Difference]: Finished difference Result 2588 states and 8385 transitions. [2019-12-27 19:08:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:08:56,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 19:08:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:56,831 INFO L225 Difference]: With dead ends: 2588 [2019-12-27 19:08:56,831 INFO L226 Difference]: Without dead ends: 2544 [2019-12-27 19:08:56,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:08:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-12-27 19:08:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2019-12-27 19:08:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-27 19:08:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2019-12-27 19:08:56,965 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2019-12-27 19:08:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:56,966 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2019-12-27 19:08:56,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:08:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2019-12-27 19:08:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:08:56,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:56,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:08:56,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash -220223314, now seen corresponding path program 1 times [2019-12-27 19:08:56,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:56,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444245884] [2019-12-27 19:08:56,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:08:57,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444245884] [2019-12-27 19:08:57,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:57,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:08:57,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873858211] [2019-12-27 19:08:57,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:57,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:57,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 99 transitions. [2019-12-27 19:08:57,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:58,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 19:08:58,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 19:08:58,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 19:08:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 19:08:58,904 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 34 states. [2019-12-27 19:09:00,285 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-12-27 19:09:03,068 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-12-27 19:09:03,397 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 19:09:04,002 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-27 19:09:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:09:04,917 INFO L93 Difference]: Finished difference Result 3164 states and 10236 transitions. [2019-12-27 19:09:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 19:09:04,918 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 25 [2019-12-27 19:09:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:09:04,941 INFO L225 Difference]: With dead ends: 3164 [2019-12-27 19:09:04,942 INFO L226 Difference]: Without dead ends: 3164 [2019-12-27 19:09:04,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 19:09:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-12-27 19:09:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3104. [2019-12-27 19:09:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-12-27 19:09:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 10106 transitions. [2019-12-27 19:09:05,065 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 10106 transitions. Word has length 25 [2019-12-27 19:09:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:09:05,066 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 10106 transitions. [2019-12-27 19:09:05,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 19:09:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 10106 transitions. [2019-12-27 19:09:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:09:05,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:09:05,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:09:05,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:09:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:09:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1041383458, now seen corresponding path program 1 times [2019-12-27 19:09:05,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:09:05,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409183238] [2019-12-27 19:09:05,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:09:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:09:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:09:05,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409183238] [2019-12-27 19:09:05,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:09:05,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:09:05,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1616294402] [2019-12-27 19:09:05,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:09:05,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:09:05,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 37 transitions. [2019-12-27 19:09:05,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:09:05,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:09:05,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 19:09:05,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:09:05,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 19:09:05,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:09:05,666 INFO L87 Difference]: Start difference. First operand 3104 states and 10106 transitions. Second operand 14 states. [2019-12-27 19:09:07,605 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-12-27 19:09:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:09:07,933 INFO L93 Difference]: Finished difference Result 3654 states and 11776 transitions. [2019-12-27 19:09:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:09:07,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 19:09:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:09:07,958 INFO L225 Difference]: With dead ends: 3654 [2019-12-27 19:09:07,959 INFO L226 Difference]: Without dead ends: 3654 [2019-12-27 19:09:07,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:09:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-12-27 19:09:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2019-12-27 19:09:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-12-27 19:09:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2019-12-27 19:09:08,063 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2019-12-27 19:09:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:09:08,063 INFO L462 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2019-12-27 19:09:08,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 19:09:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2019-12-27 19:09:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:09:08,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:09:08,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:09:08,072 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:09:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:09:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash 907099404, now seen corresponding path program 2 times [2019-12-27 19:09:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:09:08,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096395236] [2019-12-27 19:09:08,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:09:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:09:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:09:08,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096395236] [2019-12-27 19:09:08,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:09:08,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:09:08,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907575099] [2019-12-27 19:09:08,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:09:08,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:09:08,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 135 transitions. [2019-12-27 19:09:08,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:09:10,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 19:09:10,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 19:09:10,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:09:10,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 19:09:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:09:10,549 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 39 states. [2019-12-27 19:09:11,656 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-12-27 19:09:12,063 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 45 [2019-12-27 19:09:12,338 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-12-27 19:09:12,787 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-27 19:09:13,115 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 47 [2019-12-27 19:09:13,708 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 128 [2019-12-27 19:09:14,217 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 125 [2019-12-27 19:09:14,600 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 115 [2019-12-27 19:09:15,318 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 125 [2019-12-27 19:09:16,232 WARN L192 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 173 [2019-12-27 19:09:16,736 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 121 [2019-12-27 19:09:17,110 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 111 [2019-12-27 19:09:17,595 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2019-12-27 19:09:18,480 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 169 [2019-12-27 19:09:19,527 WARN L192 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 169 [2019-12-27 19:09:20,037 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 117 [2019-12-27 19:09:20,386 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 107 [2019-12-27 19:09:21,503 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 165 [2019-12-27 19:09:22,512 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 165 [2019-12-27 19:09:22,996 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 113 [2019-12-27 19:09:23,390 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2019-12-27 19:09:24,681 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 161 [2019-12-27 19:09:25,607 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 162 [2019-12-27 19:09:26,062 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 109 [2019-12-27 19:09:26,409 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2019-12-27 19:09:27,740 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 159 [2019-12-27 19:09:28,542 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 157 [2019-12-27 19:09:29,018 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 105 [2019-12-27 19:09:29,387 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-12-27 19:09:30,593 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 153 [2019-12-27 19:09:31,426 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 154 [2019-12-27 19:09:31,899 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-27 19:09:33,127 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 149 [2019-12-27 19:09:33,892 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 150 [2019-12-27 19:09:34,173 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 53 [2019-12-27 19:09:35,213 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 147 [2019-12-27 19:09:35,594 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 59 [2019-12-27 19:09:35,890 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2019-12-27 19:09:37,010 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 67 [2019-12-27 19:09:37,396 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 65 [2019-12-27 19:09:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:09:38,721 INFO L93 Difference]: Finished difference Result 4451 states and 14411 transitions. [2019-12-27 19:09:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 19:09:38,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-27 19:09:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:09:38,769 INFO L225 Difference]: With dead ends: 4451 [2019-12-27 19:09:38,769 INFO L226 Difference]: Without dead ends: 4451 [2019-12-27 19:09:38,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=1808, Invalid=5674, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 19:09:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2019-12-27 19:09:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 3510. [2019-12-27 19:09:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3510 states. [2019-12-27 19:09:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 11354 transitions. [2019-12-27 19:09:38,882 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 11354 transitions. Word has length 25 [2019-12-27 19:09:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:09:38,883 INFO L462 AbstractCegarLoop]: Abstraction has 3510 states and 11354 transitions. [2019-12-27 19:09:38,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 19:09:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 11354 transitions. [2019-12-27 19:09:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:09:38,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:09:38,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:09:38,891 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:09:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:09:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash 356628326, now seen corresponding path program 3 times [2019-12-27 19:09:38,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:09:38,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972296524] [2019-12-27 19:09:38,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:09:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:09:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:09:39,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972296524] [2019-12-27 19:09:39,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:09:39,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:09:39,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122062990] [2019-12-27 19:09:39,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:09:39,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:09:39,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 61 transitions. [2019-12-27 19:09:39,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:09:40,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:09:40,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 19:09:40,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:09:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 19:09:40,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:09:40,006 INFO L87 Difference]: Start difference. First operand 3510 states and 11354 transitions. Second operand 20 states. [2019-12-27 19:09:40,740 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 35 [2019-12-27 19:09:41,267 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 39 [2019-12-27 19:09:41,691 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 41 [2019-12-27 19:09:42,456 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 54 [2019-12-27 19:09:43,658 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 39 [2019-12-27 19:09:44,038 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 43 [2019-12-27 19:09:44,396 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 47 [2019-12-27 19:09:44,754 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 49 [2019-12-27 19:09:45,235 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 62 [2019-12-27 19:09:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:09:46,096 INFO L93 Difference]: Finished difference Result 3971 states and 12409 transitions. [2019-12-27 19:09:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 19:09:46,096 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2019-12-27 19:09:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:09:46,108 INFO L225 Difference]: With dead ends: 3971 [2019-12-27 19:09:46,108 INFO L226 Difference]: Without dead ends: 3971 [2019-12-27 19:09:46,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 19:09:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2019-12-27 19:09:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3188. [2019-12-27 19:09:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-27 19:09:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2019-12-27 19:09:46,205 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2019-12-27 19:09:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:09:46,205 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2019-12-27 19:09:46,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 19:09:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2019-12-27 19:09:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:09:46,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:09:46,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:09:46,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:09:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:09:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1491389276, now seen corresponding path program 2 times [2019-12-27 19:09:46,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:09:46,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141386865] [2019-12-27 19:09:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:09:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:09:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:09:46,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141386865] [2019-12-27 19:09:46,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:09:46,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:09:46,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561164558] [2019-12-27 19:09:46,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:09:46,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:09:46,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:09:46,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:09:47,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:09:47,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 19:09:47,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:09:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 19:09:47,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:09:47,472 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 23 states. [2019-12-27 19:09:49,167 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-27 19:09:49,469 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2019-12-27 19:09:49,926 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 102 [2019-12-27 19:09:50,323 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-27 19:09:50,682 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2019-12-27 19:09:51,516 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 94 [2019-12-27 19:09:52,893 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-12-27 19:09:53,263 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-12-27 19:09:53,820 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 64 [2019-12-27 19:09:54,118 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-27 19:09:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:09:54,950 INFO L93 Difference]: Finished difference Result 3812 states and 11819 transitions. [2019-12-27 19:09:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:09:54,950 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-12-27 19:09:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:09:54,963 INFO L225 Difference]: With dead ends: 3812 [2019-12-27 19:09:54,963 INFO L226 Difference]: Without dead ends: 3812 [2019-12-27 19:09:54,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 19:09:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2019-12-27 19:09:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 2852. [2019-12-27 19:09:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-27 19:09:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2019-12-27 19:09:55,045 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2019-12-27 19:09:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:09:55,046 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2019-12-27 19:09:55,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 19:09:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2019-12-27 19:09:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:09:55,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:09:55,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:09:55,051 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:09:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:09:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512480, now seen corresponding path program 1 times [2019-12-27 19:09:55,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:09:55,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955945766] [2019-12-27 19:09:55,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:09:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:09:55,619 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32 [2019-12-27 19:09:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:09:55,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955945766] [2019-12-27 19:09:55,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:09:55,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:09:55,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1265834050] [2019-12-27 19:09:55,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:09:55,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:09:55,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 105 transitions. [2019-12-27 19:09:55,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:09:56,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:09:56,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 19:09:56,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:09:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 19:09:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:09:56,767 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 31 states. [2019-12-27 19:09:58,581 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-12-27 19:09:59,003 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-27 19:09:59,497 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 19:10:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:10:02,467 INFO L93 Difference]: Finished difference Result 5017 states and 16132 transitions. [2019-12-27 19:10:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 19:10:02,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-12-27 19:10:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:10:02,482 INFO L225 Difference]: With dead ends: 5017 [2019-12-27 19:10:02,482 INFO L226 Difference]: Without dead ends: 5017 [2019-12-27 19:10:02,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 19:10:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-12-27 19:10:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2019-12-27 19:10:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-27 19:10:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13063 transitions. [2019-12-27 19:10:02,606 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13063 transitions. Word has length 27 [2019-12-27 19:10:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:10:02,606 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 13063 transitions. [2019-12-27 19:10:02,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 19:10:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13063 transitions. [2019-12-27 19:10:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:10:02,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:10:02,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:10:02,616 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:10:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:10:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 363501539, now seen corresponding path program 1 times [2019-12-27 19:10:02,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:10:02,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573648176] [2019-12-27 19:10:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:10:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:10:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:10:03,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573648176] [2019-12-27 19:10:03,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:10:03,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:10:03,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082675326] [2019-12-27 19:10:03,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:10:03,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:10:03,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 51 transitions. [2019-12-27 19:10:03,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:10:03,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:10:03,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:10:03,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:10:03,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:10:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:10:03,380 INFO L87 Difference]: Start difference. First operand 4102 states and 13063 transitions. Second operand 17 states. [2019-12-27 19:10:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:10:06,335 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2019-12-27 19:10:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 19:10:06,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-12-27 19:10:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:10:06,344 INFO L225 Difference]: With dead ends: 6137 [2019-12-27 19:10:06,345 INFO L226 Difference]: Without dead ends: 6137 [2019-12-27 19:10:06,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:10:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-12-27 19:10:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2019-12-27 19:10:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-27 19:10:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2019-12-27 19:10:06,470 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2019-12-27 19:10:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:10:06,471 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2019-12-27 19:10:06,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:10:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2019-12-27 19:10:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:10:06,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:10:06,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:10:06,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:10:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:10:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139074, now seen corresponding path program 2 times [2019-12-27 19:10:06,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:10:06,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375509497] [2019-12-27 19:10:06,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:10:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:10:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:10:07,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375509497] [2019-12-27 19:10:07,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:10:07,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:10:07,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1197546475] [2019-12-27 19:10:07,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:10:07,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:10:07,182 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 141 transitions. [2019-12-27 19:10:07,182 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:10:09,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 19:10:09,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 19:10:09,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:10:09,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 19:10:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 19:10:09,351 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 42 states. [2019-12-27 19:10:10,439 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-12-27 19:10:10,777 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 43 [2019-12-27 19:10:11,126 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-12-27 19:10:11,607 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 121 [2019-12-27 19:10:11,951 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 45 [2019-12-27 19:10:12,675 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2019-12-27 19:10:13,168 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 117 [2019-12-27 19:10:13,776 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2019-12-27 19:10:14,287 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 124 [2019-12-27 19:10:14,740 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 113 [2019-12-27 19:10:15,163 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 48 [2019-12-27 19:10:15,825 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 126 [2019-12-27 19:10:16,472 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 120 [2019-12-27 19:10:16,945 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2019-12-27 19:10:17,410 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 51 [2019-12-27 19:10:18,139 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 122 [2019-12-27 19:10:18,785 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2019-12-27 19:10:19,219 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2019-12-27 19:10:19,751 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 56 [2019-12-27 19:10:20,487 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2019-12-27 19:10:21,108 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 112 [2019-12-27 19:10:21,521 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 101 [2019-12-27 19:10:22,650 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2019-12-27 19:10:23,179 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-12-27 19:10:23,592 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-12-27 19:10:24,640 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 110 [2019-12-27 19:10:25,148 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 104 [2019-12-27 19:10:26,157 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2019-12-27 19:10:27,111 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2019-12-27 19:10:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:10:29,529 INFO L93 Difference]: Finished difference Result 7277 states and 23478 transitions. [2019-12-27 19:10:29,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 19:10:29,530 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 27 [2019-12-27 19:10:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:10:29,542 INFO L225 Difference]: With dead ends: 7277 [2019-12-27 19:10:29,542 INFO L226 Difference]: Without dead ends: 7277 [2019-12-27 19:10:29,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1201, Invalid=4961, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 19:10:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2019-12-27 19:10:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 5670. [2019-12-27 19:10:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5670 states. [2019-12-27 19:10:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5670 states to 5670 states and 18095 transitions. [2019-12-27 19:10:29,694 INFO L78 Accepts]: Start accepts. Automaton has 5670 states and 18095 transitions. Word has length 27 [2019-12-27 19:10:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:10:29,694 INFO L462 AbstractCegarLoop]: Abstraction has 5670 states and 18095 transitions. [2019-12-27 19:10:29,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 19:10:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5670 states and 18095 transitions. [2019-12-27 19:10:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:10:29,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:10:29,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:10:29,714 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:10:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:10:29,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139073, now seen corresponding path program 1 times [2019-12-27 19:10:29,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:10:29,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502636424] [2019-12-27 19:10:29,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:10:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:10:30,289 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-12-27 19:10:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:10:30,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502636424] [2019-12-27 19:10:30,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:10:30,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:10:30,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282581721] [2019-12-27 19:10:30,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:10:30,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:10:30,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 141 transitions. [2019-12-27 19:10:30,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:10:32,716 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 19:10:32,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 19:10:32,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 19:10:32,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:10:32,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 19:10:32,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 19:10:32,719 INFO L87 Difference]: Start difference. First operand 5670 states and 18095 transitions. Second operand 42 states. [2019-12-27 19:10:33,940 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-12-27 19:10:34,359 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 43 [2019-12-27 19:10:34,701 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-12-27 19:10:35,253 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 121 [2019-12-27 19:10:35,667 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 48 [2019-12-27 19:10:36,519 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 127 [2019-12-27 19:10:37,028 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 117 [2019-12-27 19:10:37,828 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-12-27 19:10:38,363 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 123 [2019-12-27 19:10:38,826 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 113 [2019-12-27 19:10:39,332 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 50 [2019-12-27 19:10:40,204 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 129 [2019-12-27 19:10:40,855 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 119 [2019-12-27 19:10:41,358 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2019-12-27 19:10:41,934 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2019-12-27 19:10:42,832 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 125 [2019-12-27 19:10:43,452 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 115 [2019-12-27 19:10:43,878 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2019-12-27 19:10:44,573 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 56 [2019-12-27 19:10:45,544 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 121 [2019-12-27 19:10:46,153 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 111 [2019-12-27 19:10:46,581 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 101 [2019-12-27 19:10:47,891 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 117 [2019-12-27 19:10:48,383 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2019-12-27 19:10:48,811 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-12-27 19:10:50,049 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 113 [2019-12-27 19:10:50,512 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 103 [2019-12-27 19:10:51,662 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 109 [2019-12-27 19:10:52,751 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-27 19:10:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:10:55,696 INFO L93 Difference]: Finished difference Result 7277 states and 23358 transitions. [2019-12-27 19:10:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 19:10:55,697 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 27 [2019-12-27 19:10:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:10:55,709 INFO L225 Difference]: With dead ends: 7277 [2019-12-27 19:10:55,710 INFO L226 Difference]: Without dead ends: 7277 [2019-12-27 19:10:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1201, Invalid=4961, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 19:10:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2019-12-27 19:10:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 4480. [2019-12-27 19:10:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4480 states. [2019-12-27 19:10:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 4480 states and 14237 transitions. [2019-12-27 19:10:55,826 INFO L78 Accepts]: Start accepts. Automaton has 4480 states and 14237 transitions. Word has length 27 [2019-12-27 19:10:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:10:55,826 INFO L462 AbstractCegarLoop]: Abstraction has 4480 states and 14237 transitions. [2019-12-27 19:10:55,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 19:10:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4480 states and 14237 transitions. [2019-12-27 19:10:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:10:55,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:10:55,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:10:55,834 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:10:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:10:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227084, now seen corresponding path program 3 times [2019-12-27 19:10:55,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:10:55,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427636037] [2019-12-27 19:10:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:10:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:10:56,408 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-12-27 19:10:56,580 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-27 19:10:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:10:56,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427636037] [2019-12-27 19:10:56,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:10:56,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:10:56,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735393146] [2019-12-27 19:10:56,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:10:56,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:10:56,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 19:10:56,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:10:57,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:10:57,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 19:10:57,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:10:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 19:10:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:10:57,631 INFO L87 Difference]: Start difference. First operand 4480 states and 14237 transitions. Second operand 26 states. [2019-12-27 19:10:58,520 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 37 [2019-12-27 19:10:59,071 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 42 [2019-12-27 19:10:59,609 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 44 [2019-12-27 19:11:00,540 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 49 [2019-12-27 19:11:01,128 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 52 [2019-12-27 19:11:01,729 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 55 [2019-12-27 19:11:02,586 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-12-27 19:11:04,414 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-27 19:11:04,749 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-27 19:11:05,149 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-12-27 19:11:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:07,069 INFO L93 Difference]: Finished difference Result 7530 states and 23614 transitions. [2019-12-27 19:11:07,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 19:11:07,070 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-12-27 19:11:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:07,081 INFO L225 Difference]: With dead ends: 7530 [2019-12-27 19:11:07,081 INFO L226 Difference]: Without dead ends: 7530 [2019-12-27 19:11:07,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 19:11:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2019-12-27 19:11:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 4144. [2019-12-27 19:11:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-27 19:11:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 13229 transitions. [2019-12-27 19:11:07,192 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 13229 transitions. Word has length 27 [2019-12-27 19:11:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:07,193 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 13229 transitions. [2019-12-27 19:11:07,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 19:11:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 13229 transitions. [2019-12-27 19:11:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:07,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:07,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:07,200 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash 796249174, now seen corresponding path program 4 times [2019-12-27 19:11:07,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:07,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610331722] [2019-12-27 19:11:07,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:07,971 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-27 19:11:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:08,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610331722] [2019-12-27 19:11:08,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:08,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:11:08,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318220009] [2019-12-27 19:11:08,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:08,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:08,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 41 transitions. [2019-12-27 19:11:08,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:08,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:11:08,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 19:11:08,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 19:11:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:11:08,629 INFO L87 Difference]: Start difference. First operand 4144 states and 13229 transitions. Second operand 22 states. [2019-12-27 19:11:10,405 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-12-27 19:11:10,637 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 81 [2019-12-27 19:11:11,057 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 55 [2019-12-27 19:11:11,451 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 113 [2019-12-27 19:11:12,090 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 109 [2019-12-27 19:11:12,729 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-27 19:11:13,321 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 101 [2019-12-27 19:11:13,922 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 97 [2019-12-27 19:11:14,474 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 93 [2019-12-27 19:11:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:16,357 INFO L93 Difference]: Finished difference Result 5791 states and 18693 transitions. [2019-12-27 19:11:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 19:11:16,357 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-12-27 19:11:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:16,366 INFO L225 Difference]: With dead ends: 5791 [2019-12-27 19:11:16,366 INFO L226 Difference]: Without dead ends: 5791 [2019-12-27 19:11:16,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:11:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-12-27 19:11:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4004. [2019-12-27 19:11:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4004 states. [2019-12-27 19:11:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 12789 transitions. [2019-12-27 19:11:16,466 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 12789 transitions. Word has length 27 [2019-12-27 19:11:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:16,468 INFO L462 AbstractCegarLoop]: Abstraction has 4004 states and 12789 transitions. [2019-12-27 19:11:16,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 19:11:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 12789 transitions. [2019-12-27 19:11:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:16,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:16,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:16,476 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 471322490, now seen corresponding path program 5 times [2019-12-27 19:11:16,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:16,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603283987] [2019-12-27 19:11:16,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:17,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603283987] [2019-12-27 19:11:17,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:17,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:11:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653474244] [2019-12-27 19:11:17,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:17,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:17,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:11:17,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:17,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:17,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:11:17,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:11:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:11:17,249 INFO L87 Difference]: Start difference. First operand 4004 states and 12789 transitions. Second operand 16 states. [2019-12-27 19:11:18,554 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-27 19:11:18,960 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-12-27 19:11:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:21,157 INFO L93 Difference]: Finished difference Result 7132 states and 23100 transitions. [2019-12-27 19:11:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:21,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-27 19:11:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:21,171 INFO L225 Difference]: With dead ends: 7132 [2019-12-27 19:11:21,171 INFO L226 Difference]: Without dead ends: 7132 [2019-12-27 19:11:21,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:11:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2019-12-27 19:11:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 4049. [2019-12-27 19:11:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-27 19:11:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12934 transitions. [2019-12-27 19:11:21,270 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12934 transitions. Word has length 27 [2019-12-27 19:11:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:21,270 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 12934 transitions. [2019-12-27 19:11:21,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:11:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12934 transitions. [2019-12-27 19:11:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:21,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:21,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:21,277 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360997, now seen corresponding path program 2 times [2019-12-27 19:11:21,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:21,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811795696] [2019-12-27 19:11:21,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:22,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811795696] [2019-12-27 19:11:22,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:22,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:11:22,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400551096] [2019-12-27 19:11:22,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:22,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:22,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 87 transitions. [2019-12-27 19:11:22,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:22,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:11:22,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 19:11:22,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:22,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 19:11:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:11:22,758 INFO L87 Difference]: Start difference. First operand 4049 states and 12934 transitions. Second operand 26 states. [2019-12-27 19:11:23,962 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-12-27 19:11:24,492 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-12-27 19:11:24,844 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 44 [2019-12-27 19:11:25,346 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 86 [2019-12-27 19:11:25,654 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-12-27 19:11:25,971 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 19:11:26,377 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 82 [2019-12-27 19:11:26,714 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2019-12-27 19:11:27,030 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 19:11:27,450 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 78 [2019-12-27 19:11:27,984 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 19:11:28,677 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-27 19:11:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:33,245 INFO L93 Difference]: Finished difference Result 7060 states and 22317 transitions. [2019-12-27 19:11:33,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 19:11:33,246 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-12-27 19:11:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:33,255 INFO L225 Difference]: With dead ends: 7060 [2019-12-27 19:11:33,256 INFO L226 Difference]: Without dead ends: 7060 [2019-12-27 19:11:33,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=433, Invalid=2219, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 19:11:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7060 states. [2019-12-27 19:11:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7060 to 4831. [2019-12-27 19:11:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4831 states. [2019-12-27 19:11:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 15568 transitions. [2019-12-27 19:11:33,350 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 15568 transitions. Word has length 27 [2019-12-27 19:11:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:33,350 INFO L462 AbstractCegarLoop]: Abstraction has 4831 states and 15568 transitions. [2019-12-27 19:11:33,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 19:11:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 15568 transitions. [2019-12-27 19:11:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:33,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:33,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:33,358 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360998, now seen corresponding path program 1 times [2019-12-27 19:11:33,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:33,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211840016] [2019-12-27 19:11:33,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:34,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211840016] [2019-12-27 19:11:34,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:34,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:11:34,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714311472] [2019-12-27 19:11:34,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:34,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:34,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 87 transitions. [2019-12-27 19:11:34,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:34,891 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 19:11:34,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:11:34,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 19:11:34,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 19:11:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:11:34,892 INFO L87 Difference]: Start difference. First operand 4831 states and 15568 transitions. Second operand 26 states. [2019-12-27 19:11:35,722 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-12-27 19:11:36,114 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-12-27 19:11:36,677 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-12-27 19:11:37,051 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 46 [2019-12-27 19:11:37,618 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 90 [2019-12-27 19:11:37,946 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-12-27 19:11:38,264 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 19:11:38,702 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-12-27 19:11:39,068 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2019-12-27 19:11:39,404 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 19:11:39,861 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 82 [2019-12-27 19:11:40,401 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 19:11:41,084 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-27 19:11:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:45,687 INFO L93 Difference]: Finished difference Result 7060 states and 22186 transitions. [2019-12-27 19:11:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 19:11:45,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-12-27 19:11:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:45,697 INFO L225 Difference]: With dead ends: 7060 [2019-12-27 19:11:45,697 INFO L226 Difference]: Without dead ends: 7060 [2019-12-27 19:11:45,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=433, Invalid=2219, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 19:11:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7060 states. [2019-12-27 19:11:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7060 to 3701. [2019-12-27 19:11:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-12-27 19:11:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 11890 transitions. [2019-12-27 19:11:45,787 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 11890 transitions. Word has length 27 [2019-12-27 19:11:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:45,788 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 11890 transitions. [2019-12-27 19:11:45,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 19:11:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 11890 transitions. [2019-12-27 19:11:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:45,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:45,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:45,794 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash -122346011, now seen corresponding path program 3 times [2019-12-27 19:11:45,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:45,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684819410] [2019-12-27 19:11:45,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:46,214 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-12-27 19:11:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:46,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684819410] [2019-12-27 19:11:46,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:46,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:11:46,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208805247] [2019-12-27 19:11:46,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:46,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:46,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 47 transitions. [2019-12-27 19:11:46,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:46,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:46,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:11:46,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:11:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:11:46,846 INFO L87 Difference]: Start difference. First operand 3701 states and 11890 transitions. Second operand 19 states. [2019-12-27 19:11:48,354 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-12-27 19:11:48,717 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-12-27 19:11:49,015 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2019-12-27 19:11:49,542 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-12-27 19:11:50,022 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2019-12-27 19:11:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:52,078 INFO L93 Difference]: Finished difference Result 5467 states and 17728 transitions. [2019-12-27 19:11:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 19:11:52,078 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-12-27 19:11:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:52,087 INFO L225 Difference]: With dead ends: 5467 [2019-12-27 19:11:52,087 INFO L226 Difference]: Without dead ends: 5467 [2019-12-27 19:11:52,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:11:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-12-27 19:11:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 3701. [2019-12-27 19:11:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-12-27 19:11:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 11890 transitions. [2019-12-27 19:11:52,150 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 11890 transitions. Word has length 27 [2019-12-27 19:11:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:52,150 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 11890 transitions. [2019-12-27 19:11:52,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:11:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 11890 transitions. [2019-12-27 19:11:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:52,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:52,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:52,154 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665119, now seen corresponding path program 4 times [2019-12-27 19:11:52,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:52,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103395889] [2019-12-27 19:11:52,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:52,610 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-12-27 19:11:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:52,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103395889] [2019-12-27 19:11:52,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:52,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:11:52,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246816761] [2019-12-27 19:11:52,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:52,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:52,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:11:52,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:52,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:52,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:11:52,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:11:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:52,937 INFO L87 Difference]: Start difference. First operand 3701 states and 11890 transitions. Second operand 15 states. [2019-12-27 19:11:54,261 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-27 19:11:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:56,314 INFO L93 Difference]: Finished difference Result 7459 states and 24486 transitions. [2019-12-27 19:11:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:11:56,314 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 19:11:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:56,325 INFO L225 Difference]: With dead ends: 7459 [2019-12-27 19:11:56,326 INFO L226 Difference]: Without dead ends: 7459 [2019-12-27 19:11:56,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2019-12-27 19:11:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 4436. [2019-12-27 19:11:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2019-12-27 19:11:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 14373 transitions. [2019-12-27 19:11:56,400 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 14373 transitions. Word has length 27 [2019-12-27 19:11:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:56,400 INFO L462 AbstractCegarLoop]: Abstraction has 4436 states and 14373 transitions. [2019-12-27 19:11:56,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:11:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 14373 transitions. [2019-12-27 19:11:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:11:56,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:56,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:56,405 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665118, now seen corresponding path program 2 times [2019-12-27 19:11:56,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:56,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612788934] [2019-12-27 19:11:56,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:56,804 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-12-27 19:11:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:57,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612788934] [2019-12-27 19:11:57,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:57,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:11:57,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014392004] [2019-12-27 19:11:57,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:57,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:57,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:11:57,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:57,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:57,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:11:57,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:11:57,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:57,038 INFO L87 Difference]: Start difference. First operand 4436 states and 14373 transitions. Second operand 15 states. [2019-12-27 19:12:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:00,673 INFO L93 Difference]: Finished difference Result 7459 states and 24366 transitions. [2019-12-27 19:12:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:12:00,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-27 19:12:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:00,685 INFO L225 Difference]: With dead ends: 7459 [2019-12-27 19:12:00,685 INFO L226 Difference]: Without dead ends: 7459 [2019-12-27 19:12:00,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:12:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2019-12-27 19:12:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 3707. [2019-12-27 19:12:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-12-27 19:12:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 11909 transitions. [2019-12-27 19:12:00,748 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 11909 transitions. Word has length 27 [2019-12-27 19:12:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:00,749 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 11909 transitions. [2019-12-27 19:12:00,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 11909 transitions. [2019-12-27 19:12:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:12:00,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:00,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:00,753 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:00,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 14057405, now seen corresponding path program 5 times [2019-12-27 19:12:00,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:00,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372585116] [2019-12-27 19:12:00,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:01,157 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-27 19:12:01,289 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-27 19:12:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:12:01,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372585116] [2019-12-27 19:12:01,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:01,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:12:01,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808290743] [2019-12-27 19:12:01,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:01,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:01,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 57 transitions. [2019-12-27 19:12:01,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:02,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:12:02,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 19:12:02,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:02,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 19:12:02,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:12:02,120 INFO L87 Difference]: Start difference. First operand 3707 states and 11909 transitions. Second operand 23 states. [2019-12-27 19:12:02,964 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 46 [2019-12-27 19:12:03,394 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 48 [2019-12-27 19:12:04,061 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-12-27 19:12:04,494 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2019-12-27 19:12:04,939 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2019-12-27 19:12:07,254 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-27 19:12:07,576 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-27 19:12:07,959 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-12-27 19:12:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:09,633 INFO L93 Difference]: Finished difference Result 6868 states and 21618 transitions. [2019-12-27 19:12:09,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:12:09,633 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-12-27 19:12:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:09,644 INFO L225 Difference]: With dead ends: 6868 [2019-12-27 19:12:09,644 INFO L226 Difference]: Without dead ends: 6868 [2019-12-27 19:12:09,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=261, Invalid=1461, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 19:12:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2019-12-27 19:12:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 3549. [2019-12-27 19:12:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-12-27 19:12:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2019-12-27 19:12:09,708 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2019-12-27 19:12:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:09,708 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2019-12-27 19:12:09,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 19:12:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2019-12-27 19:12:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:12:09,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:09,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:09,712 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash 399516870, now seen corresponding path program 1 times [2019-12-27 19:12:09,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:09,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926555476] [2019-12-27 19:12:09,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:12:10,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926555476] [2019-12-27 19:12:10,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:10,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:12:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32462575] [2019-12-27 19:12:10,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:10,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:10,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 108 transitions. [2019-12-27 19:12:10,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:10,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:12:10,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:12:10,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:10,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:12:10,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:12:10,328 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 19 states. [2019-12-27 19:12:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:12,778 INFO L93 Difference]: Finished difference Result 9170 states and 29857 transitions. [2019-12-27 19:12:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:12:12,778 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-12-27 19:12:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:12,793 INFO L225 Difference]: With dead ends: 9170 [2019-12-27 19:12:12,793 INFO L226 Difference]: Without dead ends: 9170 [2019-12-27 19:12:12,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:12:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2019-12-27 19:12:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 7476. [2019-12-27 19:12:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-27 19:12:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24796 transitions. [2019-12-27 19:12:12,909 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24796 transitions. Word has length 30 [2019-12-27 19:12:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:12,909 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24796 transitions. [2019-12-27 19:12:12,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:12:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24796 transitions. [2019-12-27 19:12:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:12:12,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:12,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:12,920 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1461784035, now seen corresponding path program 1 times [2019-12-27 19:12:12,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:12,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551171703] [2019-12-27 19:12:12,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:12:13,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551171703] [2019-12-27 19:12:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 19:12:13,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616226701] [2019-12-27 19:12:13,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:13,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:13,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 54 transitions. [2019-12-27 19:12:13,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:13,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:12:13,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 19:12:13,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:13,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 19:12:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:12:13,873 INFO L87 Difference]: Start difference. First operand 7476 states and 24796 transitions. Second operand 20 states. [2019-12-27 19:12:14,149 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-27 19:12:14,436 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-27 19:12:14,644 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-27 19:12:14,937 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-27 19:12:15,423 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-12-27 19:12:16,064 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-27 19:12:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:18,965 INFO L93 Difference]: Finished difference Result 9691 states and 31784 transitions. [2019-12-27 19:12:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 19:12:18,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-27 19:12:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:18,980 INFO L225 Difference]: With dead ends: 9691 [2019-12-27 19:12:18,980 INFO L226 Difference]: Without dead ends: 9691 [2019-12-27 19:12:18,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:12:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-27 19:12:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 7916. [2019-12-27 19:12:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7916 states. [2019-12-27 19:12:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 26136 transitions. [2019-12-27 19:12:19,089 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 26136 transitions. Word has length 30 [2019-12-27 19:12:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:19,089 INFO L462 AbstractCegarLoop]: Abstraction has 7916 states and 26136 transitions. [2019-12-27 19:12:19,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 19:12:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 26136 transitions. [2019-12-27 19:12:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:12:19,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:19,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:19,099 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1491245864, now seen corresponding path program 2 times [2019-12-27 19:12:19,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:19,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145440399] [2019-12-27 19:12:19,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:12:19,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145440399] [2019-12-27 19:12:19,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:19,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 19:12:19,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409180591] [2019-12-27 19:12:19,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:19,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:19,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 144 transitions. [2019-12-27 19:12:19,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:22,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-27 19:12:22,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-27 19:12:22,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-27 19:12:22,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 19:12:22,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-27 19:12:22,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-27 19:12:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 19:12:22,666 INFO L87 Difference]: Start difference. First operand 7916 states and 26136 transitions. Second operand 45 states. [2019-12-27 19:12:23,589 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-27 19:12:23,949 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-27 19:12:24,254 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 82 [2019-12-27 19:12:24,874 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 63 [2019-12-27 19:12:25,200 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 88 [2019-12-27 19:12:25,877 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 135 [2019-12-27 19:12:26,431 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 65 [2019-12-27 19:12:27,210 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 142 [2019-12-27 19:12:27,785 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 131 [2019-12-27 19:12:28,702 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 128 [2019-12-27 19:12:29,398 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 138 [2019-12-27 19:12:29,979 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 127 [2019-12-27 19:12:30,950 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 116 [2019-12-27 19:12:31,864 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 183 [2019-12-27 19:12:32,633 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 134 [2019-12-27 19:12:33,236 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 123 [2019-12-27 19:12:34,415 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 167 [2019-12-27 19:12:35,435 WARN L192 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 181 [2019-12-27 19:12:36,226 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 130 [2019-12-27 19:12:36,799 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 119 [2019-12-27 19:12:38,034 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 132 [2019-12-27 19:12:38,932 WARN L192 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 175 [2019-12-27 19:12:39,644 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 126 [2019-12-27 19:12:40,247 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 115 [2019-12-27 19:12:42,326 WARN L192 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 173 [2019-12-27 19:12:43,007 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2019-12-27 19:12:43,544 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 111 [2019-12-27 19:12:45,175 WARN L192 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 169 [2019-12-27 19:12:45,799 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 118 [2019-12-27 19:12:47,349 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 163 [2019-12-27 19:12:48,647 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 159 [2019-12-27 19:12:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:52,519 INFO L93 Difference]: Finished difference Result 11918 states and 39043 transitions. [2019-12-27 19:12:52,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 19:12:52,519 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 30 [2019-12-27 19:12:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:52,537 INFO L225 Difference]: With dead ends: 11918 [2019-12-27 19:12:52,537 INFO L226 Difference]: Without dead ends: 11918 [2019-12-27 19:12:52,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1343, Invalid=5797, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 19:12:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11918 states. [2019-12-27 19:12:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11918 to 8364. [2019-12-27 19:12:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8364 states. [2019-12-27 19:12:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8364 states to 8364 states and 27500 transitions. [2019-12-27 19:12:52,652 INFO L78 Accepts]: Start accepts. Automaton has 8364 states and 27500 transitions. Word has length 30 [2019-12-27 19:12:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:52,652 INFO L462 AbstractCegarLoop]: Abstraction has 8364 states and 27500 transitions. [2019-12-27 19:12:52,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-27 19:12:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8364 states and 27500 transitions. [2019-12-27 19:12:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:12:52,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:52,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:52,661 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -674363086, now seen corresponding path program 3 times [2019-12-27 19:12:52,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:52,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089807786] [2019-12-27 19:12:52,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:12:52,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089807786] [2019-12-27 19:12:52,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:52,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:12:52,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86860970] [2019-12-27 19:12:52,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:52,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:52,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 74 transitions. [2019-12-27 19:12:52,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:53,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:12:53,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:12:53,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:53,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:12:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:12:53,295 INFO L87 Difference]: Start difference. First operand 8364 states and 27500 transitions. Second operand 18 states. [2019-12-27 19:12:53,808 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-12-27 19:12:54,144 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-12-27 19:12:54,684 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 117 [2019-12-27 19:12:55,413 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 130 [2019-12-27 19:12:57,759 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-27 19:12:58,101 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-12-27 19:12:58,584 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2019-12-27 19:12:59,189 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 133 [2019-12-27 19:12:59,967 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-12-27 19:13:00,439 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 Received shutdown request... [2019-12-27 19:13:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 19:13:00,575 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:13:00,578 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:13:00,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:13:00 BasicIcfg [2019-12-27 19:13:00,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:13:00,580 INFO L168 Benchmark]: Toolchain (without parser) took 253357.82 ms. Allocated memory was 138.9 MB in the beginning and 673.2 MB in the end (delta: 534.2 MB). Free memory was 101.3 MB in the beginning and 93.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 542.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:13:00,580 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:13:00,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1058.69 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 124.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:13:00,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.56 ms. Allocated memory is still 203.4 MB. Free memory was 124.9 MB in the beginning and 121.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:13:00,581 INFO L168 Benchmark]: Boogie Preprocessor took 39.44 ms. Allocated memory is still 203.4 MB. Free memory was 121.9 MB in the beginning and 118.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:13:00,581 INFO L168 Benchmark]: RCFGBuilder took 765.13 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 118.9 MB in the beginning and 196.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:13:00,582 INFO L168 Benchmark]: TraceAbstraction took 251410.64 ms. Allocated memory was 235.9 MB in the beginning and 673.2 MB in the end (delta: 437.3 MB). Free memory was 194.3 MB in the beginning and 93.5 MB in the end (delta: 100.8 MB). Peak memory consumption was 538.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:13:00,584 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1058.69 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 124.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.56 ms. Allocated memory is still 203.4 MB. Free memory was 124.9 MB in the beginning and 121.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.44 ms. Allocated memory is still 203.4 MB. Free memory was 121.9 MB in the beginning and 118.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.13 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 118.9 MB in the beginning and 196.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251410.64 ms. Allocated memory was 235.9 MB in the beginning and 673.2 MB in the end (delta: 437.3 MB). Free memory was 194.3 MB in the beginning and 93.5 MB in the end (delta: 100.8 MB). Peak memory consumption was 538.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 177 ProgramPointsBefore, 58 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 6 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 118 SemBasedMoverChecksPositive, 118 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 20924 CheckedPairsTotal, 153 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (8364states) and FLOYD_HOARE automaton (currently 28 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (8364states) and FLOYD_HOARE automaton (currently 28 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (8364states) and FLOYD_HOARE automaton (currently 28 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (8364states) and FLOYD_HOARE automaton (currently 28 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Result: TIMEOUT, OverallTime: 251.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 210.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1750 SDtfs, 9746 SDslu, 14637 SDs, 0 SdLazy, 72126 SolverSat, 983 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 98.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1015 GetRequests, 20 SyntacticMatches, 20 SemanticMatches, 974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9250 ImplicationChecksByTransitivity, 126.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8364occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 42367 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 439345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown