/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 17:06:46,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 17:06:46,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 17:06:46,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 17:06:46,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 17:06:46,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 17:06:46,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 17:06:46,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 17:06:46,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 17:06:46,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 17:06:46,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 17:06:46,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 17:06:46,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 17:06:46,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 17:06:46,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 17:06:46,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 17:06:46,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 17:06:46,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 17:06:46,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 17:06:46,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 17:06:46,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 17:06:46,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 17:06:46,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 17:06:46,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 17:06:46,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 17:06:46,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 17:06:46,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 17:06:46,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 17:06:46,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 17:06:46,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 17:06:46,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 17:06:46,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 17:06:46,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 17:06:46,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 17:06:46,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 17:06:46,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 17:06:46,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 17:06:46,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 17:06:46,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 17:06:46,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 17:06:46,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 17:06:46,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 17:06:46,431 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 17:06:46,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 17:06:46,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 17:06:46,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 17:06:46,434 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 17:06:46,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 17:06:46,434 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 17:06:46,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 17:06:46,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 17:06:46,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 17:06:46,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 17:06:46,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 17:06:46,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 17:06:46,436 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 17:06:46,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 17:06:46,436 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 17:06:46,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 17:06:46,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 17:06:46,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 17:06:46,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 17:06:46,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 17:06:46,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:06:46,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 17:06:46,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 17:06:46,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 17:06:46,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 17:06:46,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 17:06:46,438 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 17:06:46,439 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 17:06:46,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 17:06:46,439 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 17:06:46,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 17:06:46,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 17:06:46,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 17:06:46,892 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 17:06:46,893 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 17:06:46,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2020-11-09 17:06:46,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4725d489f/abc098ff0d3640cf9a016590561930ed/FLAG24907a538 [2020-11-09 17:06:47,710 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 17:06:47,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2020-11-09 17:06:47,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4725d489f/abc098ff0d3640cf9a016590561930ed/FLAG24907a538 [2020-11-09 17:06:47,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4725d489f/abc098ff0d3640cf9a016590561930ed [2020-11-09 17:06:47,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 17:06:48,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 17:06:48,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 17:06:48,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 17:06:48,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 17:06:48,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:06:47" (1/1) ... [2020-11-09 17:06:48,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5192ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48, skipping insertion in model container [2020-11-09 17:06:48,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:06:47" (1/1) ... [2020-11-09 17:06:48,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 17:06:48,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 17:06:48,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:06:48,720 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 17:06:48,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:06:48,946 INFO L208 MainTranslator]: Completed translation [2020-11-09 17:06:48,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48 WrapperNode [2020-11-09 17:06:48,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 17:06:48,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 17:06:48,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 17:06:48,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 17:06:48,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:48,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 17:06:49,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 17:06:49,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 17:06:49,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 17:06:49,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (1/1) ... [2020-11-09 17:06:49,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 17:06:49,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 17:06:49,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 17:06:49,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 17:06:49,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06: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 [2020-11-09 17:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 17:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 17:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 17:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 17:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 17:06:49,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 17:06:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 17:06:49,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 17:06:49,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 17:06:49,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 17:06:49,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 17:06:49,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 17:06:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 17:06:49,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 17:06:49,173 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 17:06:51,646 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 17:06:51,647 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 17:06:51,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:06:51 BoogieIcfgContainer [2020-11-09 17:06:51,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 17:06:51,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 17:06:51,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 17:06:51,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 17:06:51,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:06:47" (1/3) ... [2020-11-09 17:06:51,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b43e06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:06:51, skipping insertion in model container [2020-11-09 17:06:51,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:06:48" (2/3) ... [2020-11-09 17:06:51,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b43e06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:06:51, skipping insertion in model container [2020-11-09 17:06:51,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:06:51" (3/3) ... [2020-11-09 17:06:51,658 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2020-11-09 17:06:51,675 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 17:06:51,675 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 17:06:51,680 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 17:06:51,681 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 17:06:51,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,726 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,726 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,727 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,727 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,732 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,732 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:06:51,755 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 17:06:51,769 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 17:06:51,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 17:06:51,794 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 17:06:51,794 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 17:06:51,795 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 17:06:51,795 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 17:06:51,795 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 17:06:51,795 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 17:06:51,795 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 17:06:51,809 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 17:06:51,810 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 17:06:51,813 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 17:06:51,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-09 17:06:51,863 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-09 17:06:51,863 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 17:06:51,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 17:06:51,872 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-11-09 17:06:52,488 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 17:06:52,593 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 17:06:52,706 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 17:06:54,961 WARN L194 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-09 17:06:54,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 17:06:54,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:54,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 17:06:55,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:55,860 WARN L194 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-09 17:06:58,097 WARN L194 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 17:06:58,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:06:58,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:06:58,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:58,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,136 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 17:06:58,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:06:58,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:58,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,162 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 17:06:58,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:06:58,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:06:58,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:58,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:06:58,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:58,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:06:58,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:58,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:06:58,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:06:58,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:06:58,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:06:58,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:06:58,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:07:01,863 WARN L194 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 363 DAG size of output: 267 [2020-11-09 17:07:02,245 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 17:07:02,882 WARN L194 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 17:07:02,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 17:07:02,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:07:03,274 WARN L194 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 17:07:05,255 WARN L194 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-09 17:07:05,591 WARN L194 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 17:07:07,600 WARN L194 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 257 DAG size of output: 233 [2020-11-09 17:07:08,598 WARN L194 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 229 [2020-11-09 17:07:08,730 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 17:07:08,849 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 17:07:08,960 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 17:07:09,076 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 17:07:10,091 WARN L194 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-09 17:07:10,630 WARN L194 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-09 17:07:15,250 WARN L194 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 271 DAG size of output: 259 [2020-11-09 17:07:16,907 WARN L194 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 255 [2020-11-09 17:07:17,449 WARN L194 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-09 17:07:17,722 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 17:07:18,221 WARN L194 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-09 17:07:18,434 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 17:07:18,465 INFO L131 LiptonReduction]: Checked pairs total: 4422 [2020-11-09 17:07:18,465 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-11-09 17:07:18,473 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-11-09 17:07:18,538 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-11-09 17:07:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-11-09 17:07:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 17:07:18,551 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:18,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 17:07:18,554 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-11-09 17:07:18,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:18,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980087024] [2020-11-09 17:07:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:18,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980087024] [2020-11-09 17:07:18,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:18,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:07:18,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1993494787] [2020-11-09 17:07:18,913 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:18,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:18,928 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 17:07:18,928 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:18,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:18,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:07:18,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:07:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:18,956 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-11-09 17:07:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:19,080 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-11-09 17:07:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:07:19,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 17:07:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:19,101 INFO L225 Difference]: With dead ends: 552 [2020-11-09 17:07:19,101 INFO L226 Difference]: Without dead ends: 452 [2020-11-09 17:07:19,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-09 17:07:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-11-09 17:07:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-11-09 17:07:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-11-09 17:07:19,199 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-11-09 17:07:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:19,199 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-11-09 17:07:19,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:07:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-11-09 17:07:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 17:07:19,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:19,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:19,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 17:07:19,202 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-11-09 17:07:19,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:19,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4104173] [2020-11-09 17:07:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:19,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4104173] [2020-11-09 17:07:19,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:19,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:07:19,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123618727] [2020-11-09 17:07:19,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:19,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:19,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 17:07:19,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:19,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:19,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:07:19,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:07:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:19,337 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-11-09 17:07:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:19,394 INFO L93 Difference]: Finished difference Result 447 states and 1343 transitions. [2020-11-09 17:07:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:07:19,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 17:07:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:19,402 INFO L225 Difference]: With dead ends: 447 [2020-11-09 17:07:19,403 INFO L226 Difference]: Without dead ends: 447 [2020-11-09 17:07:19,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-11-09 17:07:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2020-11-09 17:07:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-11-09 17:07:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1343 transitions. [2020-11-09 17:07:19,474 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1343 transitions. Word has length 9 [2020-11-09 17:07:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:19,477 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 1343 transitions. [2020-11-09 17:07:19,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:07:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1343 transitions. [2020-11-09 17:07:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:07:19,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:19,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:19,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 17:07:19,485 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash 528518820, now seen corresponding path program 1 times [2020-11-09 17:07:19,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:19,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940556333] [2020-11-09 17:07:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:19,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940556333] [2020-11-09 17:07:19,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:19,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:07:19,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2003165820] [2020-11-09 17:07:19,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:19,637 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:19,640 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 20 transitions. [2020-11-09 17:07:19,640 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:19,775 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:19,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:07:19,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:07:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:07:19,777 INFO L87 Difference]: Start difference. First operand 447 states and 1343 transitions. Second operand 4 states. [2020-11-09 17:07:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:19,868 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-11-09 17:07:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:19,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 17:07:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:19,878 INFO L225 Difference]: With dead ends: 442 [2020-11-09 17:07:19,878 INFO L226 Difference]: Without dead ends: 442 [2020-11-09 17:07:19,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:07:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-09 17:07:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-11-09 17:07:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-09 17:07:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-11-09 17:07:19,903 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 10 [2020-11-09 17:07:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:19,904 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-11-09 17:07:19,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:07:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-11-09 17:07:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:07:19,915 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:19,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:19,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 17:07:19,918 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash -128590075, now seen corresponding path program 1 times [2020-11-09 17:07:19,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:19,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807814817] [2020-11-09 17:07:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:20,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807814817] [2020-11-09 17:07:20,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:20,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:07:20,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205933612] [2020-11-09 17:07:20,005 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:20,006 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:20,008 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-11-09 17:07:20,008 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:20,089 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:20,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:07:20,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:07:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:20,091 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-11-09 17:07:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:20,131 INFO L93 Difference]: Finished difference Result 439 states and 1313 transitions. [2020-11-09 17:07:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:07:20,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 17:07:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:20,137 INFO L225 Difference]: With dead ends: 439 [2020-11-09 17:07:20,137 INFO L226 Difference]: Without dead ends: 439 [2020-11-09 17:07:20,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-09 17:07:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-11-09 17:07:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-11-09 17:07:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions. [2020-11-09 17:07:20,156 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10 [2020-11-09 17:07:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:20,157 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions. [2020-11-09 17:07:20,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:07:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions. [2020-11-09 17:07:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:07:20,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:20,158 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:20,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 17:07:20,159 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1375364982, now seen corresponding path program 1 times [2020-11-09 17:07:20,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:20,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594538176] [2020-11-09 17:07:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:20,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594538176] [2020-11-09 17:07:20,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:20,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:07:20,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791794019] [2020-11-09 17:07:20,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:20,237 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:20,242 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 40 transitions. [2020-11-09 17:07:20,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:20,429 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:20,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:07:20,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:07:20,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:20,431 INFO L87 Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 3 states. [2020-11-09 17:07:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:20,442 INFO L93 Difference]: Finished difference Result 424 states and 1261 transitions. [2020-11-09 17:07:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:07:20,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 17:07:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:20,448 INFO L225 Difference]: With dead ends: 424 [2020-11-09 17:07:20,448 INFO L226 Difference]: Without dead ends: 424 [2020-11-09 17:07:20,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:07:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-11-09 17:07:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-11-09 17:07:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-09 17:07:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-11-09 17:07:20,467 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 11 [2020-11-09 17:07:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:20,467 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-11-09 17:07:20,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:07:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-11-09 17:07:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:07:20,468 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:20,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:20,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 17:07:20,469 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times [2020-11-09 17:07:20,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:20,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798888343] [2020-11-09 17:07:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:20,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798888343] [2020-11-09 17:07:20,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:20,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:07:20,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1313815084] [2020-11-09 17:07:20,601 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:20,603 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:20,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-11-09 17:07:20,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:20,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:07:20,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:20,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:20,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:20,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:20,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:07:20,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:07:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:07:20,698 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 4 states. [2020-11-09 17:07:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:20,794 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-11-09 17:07:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:20,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 17:07:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:20,799 INFO L225 Difference]: With dead ends: 421 [2020-11-09 17:07:20,800 INFO L226 Difference]: Without dead ends: 421 [2020-11-09 17:07:20,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:07:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-11-09 17:07:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-11-09 17:07:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-09 17:07:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-11-09 17:07:20,817 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-11-09 17:07:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:20,818 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-11-09 17:07:20,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:07:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-11-09 17:07:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:07:20,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:20,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:20,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 17:07:20,819 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times [2020-11-09 17:07:20,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:20,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647730181] [2020-11-09 17:07:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:20,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647730181] [2020-11-09 17:07:20,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:20,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:07:20,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1044848801] [2020-11-09 17:07:20,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:20,954 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:20,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 50 transitions. [2020-11-09 17:07:20,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:21,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:07:21,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:21,066 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:21,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:21,275 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:21,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:07:21,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:07:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:07:21,277 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 5 states. [2020-11-09 17:07:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:21,401 INFO L93 Difference]: Finished difference Result 418 states and 1238 transitions. [2020-11-09 17:07:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:21,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 17:07:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:21,407 INFO L225 Difference]: With dead ends: 418 [2020-11-09 17:07:21,408 INFO L226 Difference]: Without dead ends: 418 [2020-11-09 17:07:21,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:07:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-11-09 17:07:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-11-09 17:07:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-09 17:07:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1238 transitions. [2020-11-09 17:07:21,424 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1238 transitions. Word has length 12 [2020-11-09 17:07:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:21,425 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1238 transitions. [2020-11-09 17:07:21,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:07:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1238 transitions. [2020-11-09 17:07:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:07:21,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:21,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:21,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 17:07:21,427 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-11-09 17:07:21,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:21,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947054047] [2020-11-09 17:07:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:21,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947054047] [2020-11-09 17:07:21,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:21,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:07:21,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831299366] [2020-11-09 17:07:21,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:21,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:21,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-11-09 17:07:21,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:21,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:21,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:07:21,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:21,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:07:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:07:21,590 INFO L87 Difference]: Start difference. First operand 418 states and 1238 transitions. Second operand 5 states. [2020-11-09 17:07:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:21,723 INFO L93 Difference]: Finished difference Result 417 states and 1233 transitions. [2020-11-09 17:07:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:21,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 17:07:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:21,728 INFO L225 Difference]: With dead ends: 417 [2020-11-09 17:07:21,729 INFO L226 Difference]: Without dead ends: 417 [2020-11-09 17:07:21,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:07:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-09 17:07:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 409. [2020-11-09 17:07:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-11-09 17:07:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1208 transitions. [2020-11-09 17:07:21,746 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1208 transitions. Word has length 12 [2020-11-09 17:07:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:21,747 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1208 transitions. [2020-11-09 17:07:21,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:07:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1208 transitions. [2020-11-09 17:07:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:07:21,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:21,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:21,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 17:07:21,749 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:21,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-11-09 17:07:21,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:21,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396519971] [2020-11-09 17:07:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:21,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396519971] [2020-11-09 17:07:21,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:21,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:07:21,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171349145] [2020-11-09 17:07:21,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:21,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:21,982 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-11-09 17:07:21,982 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:21,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:07:21,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:21,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:07:21,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:21,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:21,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:21,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:21,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:21,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:21,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,292 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 22 [2020-11-09 17:07:22,307 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:07:22,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,307 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:07:22,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:22,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:22,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:22,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,459 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:22,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,460 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:22,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,462 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:22,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:07:22,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:07:22,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:07:22,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:07:22,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:22,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:22,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:22,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:22,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:22,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:22,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,636 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:07:22,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:07:22,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:22,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [11939#(and (= ~y$r_buff1_thd0~0 0) (or (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0)) (or (= ~y$w_buff1~0 0) (= (mod ~y$w_buff1_used~0 256) 0)) (<= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$r_buff0_thd0~0 0)), 11940#(and (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 17:07:22,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 17:07:22,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 17:07:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:07:22,820 INFO L87 Difference]: Start difference. First operand 409 states and 1208 transitions. Second operand 8 states. [2020-11-09 17:07:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:22,964 INFO L93 Difference]: Finished difference Result 405 states and 1194 transitions. [2020-11-09 17:07:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:22,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-11-09 17:07:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:22,970 INFO L225 Difference]: With dead ends: 405 [2020-11-09 17:07:22,970 INFO L226 Difference]: Without dead ends: 405 [2020-11-09 17:07:22,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:07:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2020-11-09 17:07:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2020-11-09 17:07:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-11-09 17:07:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1194 transitions. [2020-11-09 17:07:22,986 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1194 transitions. Word has length 13 [2020-11-09 17:07:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:22,987 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 1194 transitions. [2020-11-09 17:07:22,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 17:07:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1194 transitions. [2020-11-09 17:07:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:07:22,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:22,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:22,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 17:07:22,989 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1122009596, now seen corresponding path program 1 times [2020-11-09 17:07:22,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:22,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128503392] [2020-11-09 17:07:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:23,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128503392] [2020-11-09 17:07:23,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:23,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:07:23,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346757866] [2020-11-09 17:07:23,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:23,169 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:23,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 54 transitions. [2020-11-09 17:07:23,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:23,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13164#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 17:07:23,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:07:23,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:07:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:07:23,465 INFO L87 Difference]: Start difference. First operand 405 states and 1194 transitions. Second operand 7 states. [2020-11-09 17:07:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:23,621 INFO L93 Difference]: Finished difference Result 452 states and 1327 transitions. [2020-11-09 17:07:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:23,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-11-09 17:07:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:23,627 INFO L225 Difference]: With dead ends: 452 [2020-11-09 17:07:23,627 INFO L226 Difference]: Without dead ends: 452 [2020-11-09 17:07:23,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:07:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-09 17:07:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 444. [2020-11-09 17:07:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-09 17:07:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1309 transitions. [2020-11-09 17:07:23,645 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1309 transitions. Word has length 13 [2020-11-09 17:07:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:23,646 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1309 transitions. [2020-11-09 17:07:23,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:07:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1309 transitions. [2020-11-09 17:07:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:07:23,647 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:23,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:23,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 17:07:23,648 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash -313686143, now seen corresponding path program 1 times [2020-11-09 17:07:23,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:23,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659176739] [2020-11-09 17:07:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:23,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659176739] [2020-11-09 17:07:23,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:23,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:07:23,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [430963352] [2020-11-09 17:07:23,727 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:23,729 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:23,735 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 34 transitions. [2020-11-09 17:07:23,735 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:23,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:23,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:23,748 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:23,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:23,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:23,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:23,926 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:23,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:07:23,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:07:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:07:23,928 INFO L87 Difference]: Start difference. First operand 444 states and 1309 transitions. Second operand 4 states. [2020-11-09 17:07:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:23,982 INFO L93 Difference]: Finished difference Result 702 states and 2066 transitions. [2020-11-09 17:07:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:23,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 17:07:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:23,988 INFO L225 Difference]: With dead ends: 702 [2020-11-09 17:07:23,988 INFO L226 Difference]: Without dead ends: 420 [2020-11-09 17:07:23,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:07:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-11-09 17:07:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-11-09 17:07:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-09 17:07:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1221 transitions. [2020-11-09 17:07:24,008 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1221 transitions. Word has length 13 [2020-11-09 17:07:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:24,008 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1221 transitions. [2020-11-09 17:07:24,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:07:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1221 transitions. [2020-11-09 17:07:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:07:24,010 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:24,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:24,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 17:07:24,010 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:24,010 INFO L82 PathProgramCache]: Analyzing trace with hash -337816853, now seen corresponding path program 2 times [2020-11-09 17:07:24,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:24,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73405329] [2020-11-09 17:07:24,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:24,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73405329] [2020-11-09 17:07:24,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:24,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:07:24,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889960394] [2020-11-09 17:07:24,077 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:24,079 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:24,087 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2020-11-09 17:07:24,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:24,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:24,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,164 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,325 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,327 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,328 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,404 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:24,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:07:24,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:24,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:07:24,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:07:24,406 INFO L87 Difference]: Start difference. First operand 420 states and 1221 transitions. Second operand 4 states. [2020-11-09 17:07:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:24,451 INFO L93 Difference]: Finished difference Result 875 states and 2458 transitions. [2020-11-09 17:07:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:07:24,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 17:07:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:24,455 INFO L225 Difference]: With dead ends: 875 [2020-11-09 17:07:24,456 INFO L226 Difference]: Without dead ends: 392 [2020-11-09 17:07:24,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:07:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-09 17:07:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 368. [2020-11-09 17:07:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-11-09 17:07:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 992 transitions. [2020-11-09 17:07:24,473 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 992 transitions. Word has length 13 [2020-11-09 17:07:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:24,476 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 992 transitions. [2020-11-09 17:07:24,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:07:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 992 transitions. [2020-11-09 17:07:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:07:24,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:24,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:24,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 17:07:24,478 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-11-09 17:07:24,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:24,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586061115] [2020-11-09 17:07:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:24,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586061115] [2020-11-09 17:07:24,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:24,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:07:24,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604761487] [2020-11-09 17:07:24,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:24,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:24,708 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2020-11-09 17:07:24,709 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:24,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:24,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,760 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:24,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:07:24,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:24,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:07:24,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:25,086 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [17678#(and (= ~y~0 1) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-11-09 17:07:25,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 17:07:25,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 17:07:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:07:25,088 INFO L87 Difference]: Start difference. First operand 368 states and 992 transitions. Second operand 8 states. [2020-11-09 17:07:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:25,343 INFO L93 Difference]: Finished difference Result 382 states and 1023 transitions. [2020-11-09 17:07:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:07:25,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 17:07:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:25,348 INFO L225 Difference]: With dead ends: 382 [2020-11-09 17:07:25,348 INFO L226 Difference]: Without dead ends: 382 [2020-11-09 17:07:25,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-11-09 17:07:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-11-09 17:07:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 346. [2020-11-09 17:07:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-11-09 17:07:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 927 transitions. [2020-11-09 17:07:25,361 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 927 transitions. Word has length 14 [2020-11-09 17:07:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:25,361 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 927 transitions. [2020-11-09 17:07:25,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 17:07:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 927 transitions. [2020-11-09 17:07:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:07:25,362 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:25,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:25,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 17:07:25,363 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-11-09 17:07:25,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:25,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807349543] [2020-11-09 17:07:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:25,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807349543] [2020-11-09 17:07:25,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:25,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:07:25,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024126343] [2020-11-09 17:07:25,537 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:25,539 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:25,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2020-11-09 17:07:25,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:25,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:25,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:25,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:25,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:25,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:25,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:25,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 17:07:25,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:25,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:25,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:25,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18763#(and (= ~y~0 1) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 17:07:25,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:07:25,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:07:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:07:25,947 INFO L87 Difference]: Start difference. First operand 346 states and 927 transitions. Second operand 7 states. [2020-11-09 17:07:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:26,106 INFO L93 Difference]: Finished difference Result 462 states and 1197 transitions. [2020-11-09 17:07:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:07:26,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-09 17:07:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:26,110 INFO L225 Difference]: With dead ends: 462 [2020-11-09 17:07:26,111 INFO L226 Difference]: Without dead ends: 358 [2020-11-09 17:07:26,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:07:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-11-09 17:07:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2020-11-09 17:07:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-11-09 17:07:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 888 transitions. [2020-11-09 17:07:26,124 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 888 transitions. Word has length 14 [2020-11-09 17:07:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:26,124 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 888 transitions. [2020-11-09 17:07:26,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:07:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 888 transitions. [2020-11-09 17:07:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:07:26,126 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:26,126 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:26,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 17:07:26,126 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 1 times [2020-11-09 17:07:26,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:26,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862425132] [2020-11-09 17:07:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:26,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862425132] [2020-11-09 17:07:26,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:26,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:07:26,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926572324] [2020-11-09 17:07:26,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:26,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:26,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2020-11-09 17:07:26,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:26,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:26,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,503 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,572 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:26,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:26,744 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:26,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,745 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:26,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:26,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:26,804 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19910#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 17:07:26,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:07:26,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:07:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:07:26,805 INFO L87 Difference]: Start difference. First operand 340 states and 888 transitions. Second operand 5 states. [2020-11-09 17:07:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:26,893 INFO L93 Difference]: Finished difference Result 257 states and 585 transitions. [2020-11-09 17:07:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:07:26,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 17:07:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:26,896 INFO L225 Difference]: With dead ends: 257 [2020-11-09 17:07:26,896 INFO L226 Difference]: Without dead ends: 169 [2020-11-09 17:07:26,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:07:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-11-09 17:07:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2020-11-09 17:07:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-11-09 17:07:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 337 transitions. [2020-11-09 17:07:26,902 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 337 transitions. Word has length 14 [2020-11-09 17:07:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:26,902 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 337 transitions. [2020-11-09 17:07:26,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:07:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 337 transitions. [2020-11-09 17:07:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 17:07:26,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:26,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:26,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 17:07:26,903 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-11-09 17:07:26,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:26,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938785163] [2020-11-09 17:07:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:27,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938785163] [2020-11-09 17:07:27,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:27,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:07:27,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001191430] [2020-11-09 17:07:27,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:27,319 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:27,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-11-09 17:07:27,326 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:27,555 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [20517#(and (= ~y~0 1) (not (= 2 ~y$w_buff0~0)) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 20518#(and (not (= 2 ~y$w_buff0~0)) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-11-09 17:07:27,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 17:07:27,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 17:07:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:07:27,556 INFO L87 Difference]: Start difference. First operand 169 states and 337 transitions. Second operand 9 states. [2020-11-09 17:07:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:27,907 INFO L93 Difference]: Finished difference Result 186 states and 361 transitions. [2020-11-09 17:07:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:07:27,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-11-09 17:07:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:27,910 INFO L225 Difference]: With dead ends: 186 [2020-11-09 17:07:27,911 INFO L226 Difference]: Without dead ends: 126 [2020-11-09 17:07:27,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-11-09 17:07:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-09 17:07:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2020-11-09 17:07:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-09 17:07:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 228 transitions. [2020-11-09 17:07:27,916 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 228 transitions. Word has length 17 [2020-11-09 17:07:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:27,916 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 228 transitions. [2020-11-09 17:07:27,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 17:07:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 228 transitions. [2020-11-09 17:07:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 17:07:27,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:27,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:27,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 17:07:27,918 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-11-09 17:07:27,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:27,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230623084] [2020-11-09 17:07:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:07:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:07:28,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230623084] [2020-11-09 17:07:28,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:07:28,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:07:28,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753573536] [2020-11-09 17:07:28,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:07:28,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:07:28,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 88 transitions. [2020-11-09 17:07:28,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:07:28,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:07:28,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,202 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:28,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,233 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,234 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:28,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:28,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,274 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:28,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,309 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:28,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:07:28,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:07:28,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:07:28,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:07:28,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:07:28,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:07:28,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:07:28,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:07:28,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:07:28,451 INFO L87 Difference]: Start difference. First operand 115 states and 228 transitions. Second operand 6 states. [2020-11-09 17:07:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:07:28,538 INFO L93 Difference]: Finished difference Result 102 states and 201 transitions. [2020-11-09 17:07:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:07:28,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 17:07:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:07:28,540 INFO L225 Difference]: With dead ends: 102 [2020-11-09 17:07:28,540 INFO L226 Difference]: Without dead ends: 59 [2020-11-09 17:07:28,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:07:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-09 17:07:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-09 17:07:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-09 17:07:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2020-11-09 17:07:28,543 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 17 [2020-11-09 17:07:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:07:28,543 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2020-11-09 17:07:28,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:07:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2020-11-09 17:07:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 17:07:28,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:07:28,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:07:28,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 17:07:28,544 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:07:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:07:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-11-09 17:07:28,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:07:28,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617665657] [2020-11-09 17:07:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:07:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:07:28,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:07:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:07:28,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:07:28,717 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 17:07:28,717 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 17:07:28,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 17:07:28,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:07:28 BasicIcfg [2020-11-09 17:07:28,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 17:07:28,842 INFO L168 Benchmark]: Toolchain (without parser) took 40841.62 ms. Allocated memory was 159.4 MB in the beginning and 336.6 MB in the end (delta: 177.2 MB). Free memory was 134.2 MB in the beginning and 293.3 MB in the end (delta: -159.1 MB). Peak memory consumption was 203.8 MB. Max. memory is 8.0 GB. [2020-11-09 17:07:28,843 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 125.8 MB. Free memory was 95.3 MB in the beginning and 95.1 MB in the end (delta: 160.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:07:28,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 936.88 ms. Allocated memory is still 159.4 MB. Free memory was 133.6 MB in the beginning and 129.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. [2020-11-09 17:07:28,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 159.4 MB. Free memory was 129.2 MB in the beginning and 126.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:07:28,844 INFO L168 Benchmark]: Boogie Preprocessor took 62.20 ms. Allocated memory is still 159.4 MB. Free memory was 126.2 MB in the beginning and 124.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:07:28,850 INFO L168 Benchmark]: RCFGBuilder took 2571.93 ms. Allocated memory was 159.4 MB in the beginning and 194.0 MB in the end (delta: 34.6 MB). Free memory was 124.1 MB in the beginning and 128.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 8.0 GB. [2020-11-09 17:07:28,851 INFO L168 Benchmark]: TraceAbstraction took 37190.03 ms. Allocated memory was 194.0 MB in the beginning and 336.6 MB in the end (delta: 142.6 MB). Free memory was 128.1 MB in the beginning and 293.3 MB in the end (delta: -165.3 MB). Peak memory consumption was 162.4 MB. Max. memory is 8.0 GB. [2020-11-09 17:07:28,856 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.86 ms. Allocated memory is still 125.8 MB. Free memory was 95.3 MB in the beginning and 95.1 MB in the end (delta: 160.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 936.88 ms. Allocated memory is still 159.4 MB. Free memory was 133.6 MB in the beginning and 129.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 159.4 MB. Free memory was 129.2 MB in the beginning and 126.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 62.20 ms. Allocated memory is still 159.4 MB. Free memory was 126.2 MB in the beginning and 124.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2571.93 ms. Allocated memory was 159.4 MB in the beginning and 194.0 MB in the end (delta: 34.6 MB). Free memory was 124.1 MB in the beginning and 128.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 37190.03 ms. Allocated memory was 194.0 MB in the beginning and 336.6 MB in the end (delta: 142.6 MB). Free memory was 128.1 MB in the beginning and 293.3 MB in the end (delta: -165.3 MB). Peak memory consumption was 162.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 911 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 56 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 26.6s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 25 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 4422 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2183; [L814] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2184; [L816] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2185; [L818] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe017_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.7s, HoareTripleCheckerStatistics: 324 SDtfs, 288 SDslu, 591 SDs, 0 SdLazy, 425 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 202 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 105 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 23367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...