/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-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:38:10,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:38:10,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:38:10,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:38:10,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:38:10,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:38:10,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:38:10,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:38:10,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:38:10,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:38:10,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:38:10,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:38:10,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:38:10,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:38:10,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:38:10,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:38:10,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:38:10,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:38:11,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:38:11,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:38:11,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:38:11,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:38:11,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:38:11,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:38:11,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:38:11,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:38:11,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:38:11,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:38:11,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:38:11,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:38:11,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:38:11,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:38:11,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:38:11,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:38:11,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:38:11,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:38:11,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:38:11,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:38:11,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:38:11,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:38:11,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:38:11,041 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-WP.epf [2020-11-09 15:38:11,097 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:38:11,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:38:11,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:38:11,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:38:11,101 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:38:11,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:38:11,102 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:38:11,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:38:11,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:38:11,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:38:11,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:38:11,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:38:11,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:38:11,104 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:38:11,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:38:11,105 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:38:11,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:38:11,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:38:11,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:38:11,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:38:11,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:38:11,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:38:11,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:38:11,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:38:11,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:38:11,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:38:11,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:38:11,108 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:38:11,108 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:38:11,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:38:11,108 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 15:38:11,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:38:11,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:38:11,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:38:11,542 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:38:11,543 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:38:11,544 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 15:38:11,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abd2deda/17ef4319ca3e42259c8a1d82557f8eda/FLAGa496144aa [2020-11-09 15:38:12,421 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:38:12,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2020-11-09 15:38:12,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abd2deda/17ef4319ca3e42259c8a1d82557f8eda/FLAGa496144aa [2020-11-09 15:38:12,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abd2deda/17ef4319ca3e42259c8a1d82557f8eda [2020-11-09 15:38:12,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:38:12,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:38:12,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:38:12,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:38:12,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:38:12,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:38:12" (1/1) ... [2020-11-09 15:38:12,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794b51fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:12, skipping insertion in model container [2020-11-09 15:38:12,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:38:12" (1/1) ... [2020-11-09 15:38:12,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:38:12,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:38:13,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:38:13,247 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:38:13,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:38:13,453 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:38:13,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13 WrapperNode [2020-11-09 15:38:13,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:38:13,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:38:13,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:38:13,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:38:13,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:38:13,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:38:13,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:38:13,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:38:13,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (1/1) ... [2020-11-09 15:38:13,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:38:13,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:38:13,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:38:13,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:38:13,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (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 15:38:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:38:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:38:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:38:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:38:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:38:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:38:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:38:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:38:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:38:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:38:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:38:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:38:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:38:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:38:13,715 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 15:38:16,551 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:38:16,551 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:38:16,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:38:16 BoogieIcfgContainer [2020-11-09 15:38:16,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:38:16,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:38:16,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:38:16,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:38:16,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:38:12" (1/3) ... [2020-11-09 15:38:16,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac953ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:38:16, skipping insertion in model container [2020-11-09 15:38:16,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:38:13" (2/3) ... [2020-11-09 15:38:16,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac953ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:38:16, skipping insertion in model container [2020-11-09 15:38:16,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:38:16" (3/3) ... [2020-11-09 15:38:16,563 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2020-11-09 15:38:16,579 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:38:16,580 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:38:16,584 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:38:16,585 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:38:16,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,628 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,628 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,629 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,629 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,630 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,630 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,631 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,632 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,643 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,643 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,651 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,687 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,687 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,691 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:38:16,695 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:38:16,708 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 15:38:16,733 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:38:16,733 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:38:16,733 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:38:16,733 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:38:16,734 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:38:16,734 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:38:16,734 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:38:16,734 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:38:16,747 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:38:16,748 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 15:38:16,751 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 15:38:16,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-09 15:38:16,802 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-09 15:38:16,802 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:38:16,806 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 15:38:16,810 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-11-09 15:38:17,572 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 15:38:17,697 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:38:20,150 WARN L194 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-09 15:38:20,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 15:38:20,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:20,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 15:38:20,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:21,157 WARN L194 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-09 15:38:23,763 WARN L194 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 15:38:23,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:38:23,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:38:23,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:23,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,805 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 15:38:23,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:38:23,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:23,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,824 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 15:38:23,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:23,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:38:23,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:23,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:38:23,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:38:23,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:38:23,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:23,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:38:23,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:23,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:38:23,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:38:23,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:38:23,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:27,835 WARN L194 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 363 DAG size of output: 267 [2020-11-09 15:38:28,292 WARN L194 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 15:38:28,441 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:38:28,990 WARN L194 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 15:38:28,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:38:28,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:38:29,471 WARN L194 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 15:38:30,898 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 15:38:31,054 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 15:38:31,856 WARN L194 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-09 15:38:32,220 WARN L194 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 15:38:34,463 WARN L194 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 257 DAG size of output: 233 [2020-11-09 15:38:35,546 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 229 [2020-11-09 15:38:35,705 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 15:38:35,842 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 15:38:35,973 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 15:38:36,106 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 15:38:37,131 WARN L194 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-09 15:38:37,612 WARN L194 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-09 15:38:42,163 WARN L194 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 271 DAG size of output: 259 [2020-11-09 15:38:43,807 WARN L194 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 255 [2020-11-09 15:38:44,423 WARN L194 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-09 15:38:44,691 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 15:38:45,279 WARN L194 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-09 15:38:45,551 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 15:38:45,583 INFO L131 LiptonReduction]: Checked pairs total: 4422 [2020-11-09 15:38:45,583 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-11-09 15:38:45,589 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-11-09 15:38:45,656 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-11-09 15:38:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-11-09 15:38:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 15:38:45,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:45,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 15:38:45,679 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 15:38:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-11-09 15:38:45,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:45,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97772981] [2020-11-09 15:38:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:45,976 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 15:38:45,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97772981] [2020-11-09 15:38:45,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:45,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:38:45,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583758375] [2020-11-09 15:38:45,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:45,982 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:45,995 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 15:38:45,995 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:46,000 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:46,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:38:46,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:46,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:38:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:38:46,020 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-11-09 15:38:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:46,124 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-11-09 15:38:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:38:46,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 15:38:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:46,147 INFO L225 Difference]: With dead ends: 552 [2020-11-09 15:38:46,147 INFO L226 Difference]: Without dead ends: 452 [2020-11-09 15:38:46,149 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 15:38:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-09 15:38:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-11-09 15:38:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-11-09 15:38:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-11-09 15:38:46,245 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-11-09 15:38:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:46,245 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-11-09 15:38:46,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:38:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-11-09 15:38:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:38:46,247 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:46,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:46,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:38:46,247 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 15:38:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-11-09 15:38:46,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:46,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531649131] [2020-11-09 15:38:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:46,437 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 15:38:46,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531649131] [2020-11-09 15:38:46,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:46,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:38:46,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039837889] [2020-11-09 15:38:46,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:46,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:46,443 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:38:46,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:46,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:46,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:38:46,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:38:46,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:38:46,447 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-11-09 15:38:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:46,501 INFO L93 Difference]: Finished difference Result 447 states and 1343 transitions. [2020-11-09 15:38:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:38:46,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:38:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:46,509 INFO L225 Difference]: With dead ends: 447 [2020-11-09 15:38:46,510 INFO L226 Difference]: Without dead ends: 447 [2020-11-09 15:38:46,511 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 15:38:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-11-09 15:38:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2020-11-09 15:38:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-11-09 15:38:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1343 transitions. [2020-11-09 15:38:46,573 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1343 transitions. Word has length 9 [2020-11-09 15:38:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:46,580 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 1343 transitions. [2020-11-09 15:38:46,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:38:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1343 transitions. [2020-11-09 15:38:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:38:46,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:46,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:46,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:38:46,583 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 15:38:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:46,587 INFO L82 PathProgramCache]: Analyzing trace with hash 528518820, now seen corresponding path program 1 times [2020-11-09 15:38:46,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:46,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731688763] [2020-11-09 15:38:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:46,727 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 15:38:46,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731688763] [2020-11-09 15:38:46,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:46,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:38:46,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1591824190] [2020-11-09 15:38:46,728 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:46,730 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:46,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 20 transitions. [2020-11-09 15:38:46,733 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:46,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:46,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:38:46,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:38:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:38:46,833 INFO L87 Difference]: Start difference. First operand 447 states and 1343 transitions. Second operand 4 states. [2020-11-09 15:38:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:46,922 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-11-09 15:38:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:46,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 15:38:46,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:46,928 INFO L225 Difference]: With dead ends: 442 [2020-11-09 15:38:46,928 INFO L226 Difference]: Without dead ends: 442 [2020-11-09 15:38:46,928 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 15:38:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-09 15:38:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-11-09 15:38:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-09 15:38:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-11-09 15:38:46,946 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 10 [2020-11-09 15:38:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:46,947 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-11-09 15:38:46,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:38:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-11-09 15:38:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:38:46,949 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:46,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:46,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:38:46,949 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 15:38:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash -128590075, now seen corresponding path program 1 times [2020-11-09 15:38:46,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:46,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508968691] [2020-11-09 15:38:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:47,038 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 15:38:47,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508968691] [2020-11-09 15:38:47,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:47,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:38:47,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185256463] [2020-11-09 15:38:47,039 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:47,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:47,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-11-09 15:38:47,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:47,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:47,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:38:47,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:38:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:38:47,105 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-11-09 15:38:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:47,145 INFO L93 Difference]: Finished difference Result 439 states and 1313 transitions. [2020-11-09 15:38:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:38:47,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 15:38:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:47,151 INFO L225 Difference]: With dead ends: 439 [2020-11-09 15:38:47,151 INFO L226 Difference]: Without dead ends: 439 [2020-11-09 15:38:47,152 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 15:38:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-09 15:38:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-11-09 15:38:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-11-09 15:38:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions. [2020-11-09 15:38:47,169 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10 [2020-11-09 15:38:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:47,169 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions. [2020-11-09 15:38:47,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:38:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions. [2020-11-09 15:38:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:38:47,171 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:47,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:47,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:38:47,171 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 15:38:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:47,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1375364982, now seen corresponding path program 1 times [2020-11-09 15:38:47,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:47,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042627527] [2020-11-09 15:38:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:38:47,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042627527] [2020-11-09 15:38:47,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:47,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:38:47,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273119859] [2020-11-09 15:38:47,230 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:47,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:47,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 40 transitions. [2020-11-09 15:38:47,236 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:47,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:47,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:38:47,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:38:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:38:47,456 INFO L87 Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 3 states. [2020-11-09 15:38:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:47,468 INFO L93 Difference]: Finished difference Result 424 states and 1261 transitions. [2020-11-09 15:38:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:38:47,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 15:38:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:47,474 INFO L225 Difference]: With dead ends: 424 [2020-11-09 15:38:47,475 INFO L226 Difference]: Without dead ends: 424 [2020-11-09 15:38:47,475 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 15:38:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-11-09 15:38:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-11-09 15:38:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-09 15:38:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-11-09 15:38:47,493 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 11 [2020-11-09 15:38:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:47,494 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-11-09 15:38:47,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:38:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-11-09 15:38:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:38:47,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:47,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:47,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:38:47,496 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 15:38:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times [2020-11-09 15:38:47,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:47,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81780425] [2020-11-09 15:38:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:47,596 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 15:38:47,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81780425] [2020-11-09 15:38:47,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:47,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:38:47,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911359773] [2020-11-09 15:38:47,597 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:47,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:47,601 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-11-09 15:38:47,601 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:47,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:38:47,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:47,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:47,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:47,665 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:47,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:38:47,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:47,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:38:47,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:38:47,667 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 4 states. [2020-11-09 15:38:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:47,747 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-11-09 15:38:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:47,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 15:38:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:47,752 INFO L225 Difference]: With dead ends: 421 [2020-11-09 15:38:47,753 INFO L226 Difference]: Without dead ends: 421 [2020-11-09 15:38:47,753 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 15:38:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-11-09 15:38:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-11-09 15:38:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-09 15:38:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-11-09 15:38:47,770 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-11-09 15:38:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:47,771 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-11-09 15:38:47,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:38:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-11-09 15:38:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:38:47,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:47,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:47,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:38:47,773 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 15:38:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times [2020-11-09 15:38:47,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:47,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823908344] [2020-11-09 15:38:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:38:47,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823908344] [2020-11-09 15:38:47,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:47,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:38:47,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423026939] [2020-11-09 15:38:47,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:47,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:47,912 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 50 transitions. [2020-11-09 15:38:47,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:48,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:38:48,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:48,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:48,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:48,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:48,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:38:48,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:38:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:38:48,216 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 5 states. [2020-11-09 15:38:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:48,354 INFO L93 Difference]: Finished difference Result 418 states and 1238 transitions. [2020-11-09 15:38:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:48,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 15:38:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:48,361 INFO L225 Difference]: With dead ends: 418 [2020-11-09 15:38:48,361 INFO L226 Difference]: Without dead ends: 418 [2020-11-09 15:38:48,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:38:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-11-09 15:38:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-11-09 15:38:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-09 15:38:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1238 transitions. [2020-11-09 15:38:48,383 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1238 transitions. Word has length 12 [2020-11-09 15:38:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:48,384 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1238 transitions. [2020-11-09 15:38:48,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:38:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1238 transitions. [2020-11-09 15:38:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:38:48,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:48,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:48,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:38:48,386 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 15:38:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-11-09 15:38:48,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:48,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100730111] [2020-11-09 15:38:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:48,502 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 15:38:48,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100730111] [2020-11-09 15:38:48,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:48,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:38:48,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [12027133] [2020-11-09 15:38:48,503 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:48,505 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:48,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-11-09 15:38:48,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:48,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:48,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:38:48,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:38:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:38:48,531 INFO L87 Difference]: Start difference. First operand 418 states and 1238 transitions. Second operand 5 states. [2020-11-09 15:38:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:48,693 INFO L93 Difference]: Finished difference Result 417 states and 1233 transitions. [2020-11-09 15:38:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:48,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 15:38:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:48,699 INFO L225 Difference]: With dead ends: 417 [2020-11-09 15:38:48,699 INFO L226 Difference]: Without dead ends: 417 [2020-11-09 15:38:48,699 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 15:38:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-09 15:38:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 409. [2020-11-09 15:38:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-11-09 15:38:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1208 transitions. [2020-11-09 15:38:48,719 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1208 transitions. Word has length 12 [2020-11-09 15:38:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:48,719 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1208 transitions. [2020-11-09 15:38:48,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:38:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1208 transitions. [2020-11-09 15:38:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:38:48,721 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:48,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:48,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:38:48,721 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 15:38:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-11-09 15:38:48,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:48,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786663033] [2020-11-09 15:38:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:48,965 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 15:38:48,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786663033] [2020-11-09 15:38:48,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:48,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:38:48,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296191065] [2020-11-09 15:38:48,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:48,969 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:48,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-11-09 15:38:48,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:48,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:48,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:48,993 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:48,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:48,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:48,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:49,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,298 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 22 [2020-11-09 15:38:49,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:49,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:49,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,321 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:49,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:49,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,483 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:49,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,486 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:49,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:49,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,567 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:49,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:49,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:49,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,684 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:49,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:49,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,687 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:49,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,690 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:49,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,691 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:49,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:49,914 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 15:38:49,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:38:49,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:38:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:38:49,917 INFO L87 Difference]: Start difference. First operand 409 states and 1208 transitions. Second operand 8 states. [2020-11-09 15:38:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:50,071 INFO L93 Difference]: Finished difference Result 405 states and 1194 transitions. [2020-11-09 15:38:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:50,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-11-09 15:38:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:50,078 INFO L225 Difference]: With dead ends: 405 [2020-11-09 15:38:50,078 INFO L226 Difference]: Without dead ends: 405 [2020-11-09 15:38:50,078 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 15:38:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2020-11-09 15:38:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2020-11-09 15:38:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-11-09 15:38:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1194 transitions. [2020-11-09 15:38:50,096 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1194 transitions. Word has length 13 [2020-11-09 15:38:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:50,097 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 1194 transitions. [2020-11-09 15:38:50,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:38:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1194 transitions. [2020-11-09 15:38:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:38:50,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:50,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:50,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:38:50,099 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 15:38:50,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1122009596, now seen corresponding path program 1 times [2020-11-09 15:38:50,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:50,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864730564] [2020-11-09 15:38:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:50,302 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 15:38:50,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864730564] [2020-11-09 15:38:50,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:50,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:38:50,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159776721] [2020-11-09 15:38:50,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:50,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:50,314 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 54 transitions. [2020-11-09 15:38:50,314 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:50,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13164#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 15:38:50,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:38:50,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:50,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:38:50,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:38:50,633 INFO L87 Difference]: Start difference. First operand 405 states and 1194 transitions. Second operand 7 states. [2020-11-09 15:38:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:50,794 INFO L93 Difference]: Finished difference Result 452 states and 1327 transitions. [2020-11-09 15:38:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:50,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-11-09 15:38:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:50,802 INFO L225 Difference]: With dead ends: 452 [2020-11-09 15:38:50,802 INFO L226 Difference]: Without dead ends: 452 [2020-11-09 15:38:50,802 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 15:38:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-09 15:38:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 444. [2020-11-09 15:38:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-09 15:38:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1309 transitions. [2020-11-09 15:38:50,823 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1309 transitions. Word has length 13 [2020-11-09 15:38:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:50,824 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1309 transitions. [2020-11-09 15:38:50,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:38:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1309 transitions. [2020-11-09 15:38:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:38:50,825 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:50,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:50,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:38:50,826 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 15:38:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash -313686143, now seen corresponding path program 1 times [2020-11-09 15:38:50,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:50,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485836789] [2020-11-09 15:38:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:38:50,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485836789] [2020-11-09 15:38:50,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:50,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:38:50,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424348263] [2020-11-09 15:38:50,919 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:50,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:50,926 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 34 transitions. [2020-11-09 15:38:50,927 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:50,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:50,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:50,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:50,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:50,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:50,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,098 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:51,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:38:51,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:51,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:38:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:38:51,100 INFO L87 Difference]: Start difference. First operand 444 states and 1309 transitions. Second operand 4 states. [2020-11-09 15:38:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:51,147 INFO L93 Difference]: Finished difference Result 702 states and 2066 transitions. [2020-11-09 15:38:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:38:51,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 15:38:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:51,153 INFO L225 Difference]: With dead ends: 702 [2020-11-09 15:38:51,153 INFO L226 Difference]: Without dead ends: 420 [2020-11-09 15:38:51,154 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 15:38:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-11-09 15:38:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-11-09 15:38:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-09 15:38:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1221 transitions. [2020-11-09 15:38:51,171 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1221 transitions. Word has length 13 [2020-11-09 15:38:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:51,171 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1221 transitions. [2020-11-09 15:38:51,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:38:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1221 transitions. [2020-11-09 15:38:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:38:51,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:51,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:51,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:38:51,173 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 15:38:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash -337816853, now seen corresponding path program 2 times [2020-11-09 15:38:51,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:51,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551177620] [2020-11-09 15:38:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:51,228 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 15:38:51,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551177620] [2020-11-09 15:38:51,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:51,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:38:51,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1968278906] [2020-11-09 15:38:51,230 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:51,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:51,239 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2020-11-09 15:38:51,239 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:51,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:51,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,357 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,549 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,551 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,581 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:51,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:38:51,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:38:51,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:38:51,583 INFO L87 Difference]: Start difference. First operand 420 states and 1221 transitions. Second operand 4 states. [2020-11-09 15:38:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:51,631 INFO L93 Difference]: Finished difference Result 875 states and 2458 transitions. [2020-11-09 15:38:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:38:51,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 15:38:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:51,635 INFO L225 Difference]: With dead ends: 875 [2020-11-09 15:38:51,636 INFO L226 Difference]: Without dead ends: 392 [2020-11-09 15:38:51,636 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 15:38:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-09 15:38:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 368. [2020-11-09 15:38:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-11-09 15:38:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 992 transitions. [2020-11-09 15:38:51,651 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 992 transitions. Word has length 13 [2020-11-09 15:38:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:51,651 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 992 transitions. [2020-11-09 15:38:51,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:38:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 992 transitions. [2020-11-09 15:38:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:38:51,652 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:51,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:51,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:38:51,653 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 15:38:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-11-09 15:38:51,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:51,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116010337] [2020-11-09 15:38:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:51,856 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 15:38:51,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116010337] [2020-11-09 15:38:51,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:51,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:38:51,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935564802] [2020-11-09 15:38:51,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:51,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:51,867 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2020-11-09 15:38:51,868 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:51,918 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:51,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:51,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:51,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:51,925 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:51,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:52,288 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 15:38:52,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:38:52,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:38:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:38:52,290 INFO L87 Difference]: Start difference. First operand 368 states and 992 transitions. Second operand 8 states. [2020-11-09 15:38:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:52,586 INFO L93 Difference]: Finished difference Result 382 states and 1023 transitions. [2020-11-09 15:38:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:38:52,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 15:38:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:52,590 INFO L225 Difference]: With dead ends: 382 [2020-11-09 15:38:52,590 INFO L226 Difference]: Without dead ends: 382 [2020-11-09 15:38:52,591 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 15:38:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-11-09 15:38:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 346. [2020-11-09 15:38:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-11-09 15:38:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 927 transitions. [2020-11-09 15:38:52,603 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 927 transitions. Word has length 14 [2020-11-09 15:38:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:52,604 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 927 transitions. [2020-11-09 15:38:52,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:38:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 927 transitions. [2020-11-09 15:38:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:38:52,605 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:52,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:52,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:38:52,606 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 15:38:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-11-09 15:38:52,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:52,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362545058] [2020-11-09 15:38:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:52,795 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 15:38:52,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362545058] [2020-11-09 15:38:52,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:52,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:38:52,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518711215] [2020-11-09 15:38:52,796 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:52,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:52,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2020-11-09 15:38:52,805 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:52,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:52,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:52,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:52,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:52,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:52,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:52,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:38:52,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:52,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:38:52,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18764#(and (= ~y~0 1) (<= ~y$w_buff0~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 15:38:53,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:38:53,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:38:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:38:53,194 INFO L87 Difference]: Start difference. First operand 346 states and 927 transitions. Second operand 8 states. [2020-11-09 15:38:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:53,481 INFO L93 Difference]: Finished difference Result 462 states and 1197 transitions. [2020-11-09 15:38:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:38:53,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 15:38:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:53,486 INFO L225 Difference]: With dead ends: 462 [2020-11-09 15:38:53,486 INFO L226 Difference]: Without dead ends: 358 [2020-11-09 15:38:53,488 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 15:38:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-11-09 15:38:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2020-11-09 15:38:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-11-09 15:38:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 888 transitions. [2020-11-09 15:38:53,502 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 888 transitions. Word has length 14 [2020-11-09 15:38:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:53,502 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 888 transitions. [2020-11-09 15:38:53,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:38:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 888 transitions. [2020-11-09 15:38:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:38:53,503 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:53,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:38:53,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:38:53,504 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 15:38:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 1 times [2020-11-09 15:38:53,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:53,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262803590] [2020-11-09 15:38:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:53,593 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 15:38:53,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262803590] [2020-11-09 15:38:53,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:53,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:38:53,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634344208] [2020-11-09 15:38:53,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:53,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:53,607 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2020-11-09 15:38:53,607 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:53,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:53,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:53,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:53,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:53,751 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:53,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,752 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,789 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,791 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:53,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:53,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,881 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,907 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,909 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:53,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,943 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,981 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:53,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:53,982 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:53,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:54,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,014 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:54,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,015 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:54,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:54,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:54,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:54,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,103 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:54,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:54,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19915#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 15:38:54,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:38:54,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:38:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:38:54,162 INFO L87 Difference]: Start difference. First operand 340 states and 888 transitions. Second operand 5 states. [2020-11-09 15:38:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:54,247 INFO L93 Difference]: Finished difference Result 257 states and 585 transitions. [2020-11-09 15:38:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:38:54,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 15:38:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:54,249 INFO L225 Difference]: With dead ends: 257 [2020-11-09 15:38:54,249 INFO L226 Difference]: Without dead ends: 169 [2020-11-09 15:38:54,250 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 15:38:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-11-09 15:38:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2020-11-09 15:38:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-11-09 15:38:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 337 transitions. [2020-11-09 15:38:54,255 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 337 transitions. Word has length 14 [2020-11-09 15:38:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:54,255 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 337 transitions. [2020-11-09 15:38:54,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:38:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 337 transitions. [2020-11-09 15:38:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:38:54,256 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:54,256 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 15:38:54,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:38:54,256 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 15:38:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-11-09 15:38:54,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:54,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896961583] [2020-11-09 15:38:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:54,579 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 15:38:54,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896961583] [2020-11-09 15:38:54,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:54,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:38:54,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317256770] [2020-11-09 15:38:54,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:54,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:54,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-11-09 15:38:54,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:54,799 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [20522#(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)), 20523#(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 15:38:54,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:38:54,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:38:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:38:54,801 INFO L87 Difference]: Start difference. First operand 169 states and 337 transitions. Second operand 9 states. [2020-11-09 15:38:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:55,188 INFO L93 Difference]: Finished difference Result 186 states and 361 transitions. [2020-11-09 15:38:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:38:55,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-11-09 15:38:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:55,190 INFO L225 Difference]: With dead ends: 186 [2020-11-09 15:38:55,190 INFO L226 Difference]: Without dead ends: 126 [2020-11-09 15:38:55,191 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 15:38:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-09 15:38:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2020-11-09 15:38:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-09 15:38:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 228 transitions. [2020-11-09 15:38:55,194 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 228 transitions. Word has length 17 [2020-11-09 15:38:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:55,195 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 228 transitions. [2020-11-09 15:38:55,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:38:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 228 transitions. [2020-11-09 15:38:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:38:55,195 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:55,196 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 15:38:55,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:38:55,196 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 15:38:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-11-09 15:38:55,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:55,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951059948] [2020-11-09 15:38:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:38:55,289 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 15:38:55,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951059948] [2020-11-09 15:38:55,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:38:55,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:38:55,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189542542] [2020-11-09 15:38:55,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:38:55,293 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:38:55,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 88 transitions. [2020-11-09 15:38:55,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:38:55,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:38:55,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,455 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:55,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,484 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:55,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,525 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:55,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,526 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,527 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:55,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:55,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:38:55,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:38:55,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:38:55,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:38:55,689 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:38:55,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:38:55,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:38:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:38:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:38:55,691 INFO L87 Difference]: Start difference. First operand 115 states and 228 transitions. Second operand 6 states. [2020-11-09 15:38:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:38:55,771 INFO L93 Difference]: Finished difference Result 102 states and 201 transitions. [2020-11-09 15:38:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:38:55,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 15:38:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:38:55,773 INFO L225 Difference]: With dead ends: 102 [2020-11-09 15:38:55,773 INFO L226 Difference]: Without dead ends: 59 [2020-11-09 15:38:55,774 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 15:38:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-09 15:38:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-09 15:38:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-09 15:38:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2020-11-09 15:38:55,776 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 17 [2020-11-09 15:38:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:38:55,776 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2020-11-09 15:38:55,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:38:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2020-11-09 15:38:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 15:38:55,777 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:38:55,777 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 15:38:55,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 15:38:55,777 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 15:38:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:38:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-11-09 15:38:55,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:38:55,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345792259] [2020-11-09 15:38:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:38:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:38:55,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:38:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:38:55,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:38:55,911 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:38:55,912 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:38:55,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 15:38:56,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:38:56 BasicIcfg [2020-11-09 15:38:56,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:38:56,038 INFO L168 Benchmark]: Toolchain (without parser) took 43362.77 ms. Allocated memory was 151.0 MB in the beginning and 319.8 MB in the end (delta: 168.8 MB). Free memory was 124.8 MB in the beginning and 104.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 191.0 MB. Max. memory is 8.0 GB. [2020-11-09 15:38:56,038 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:38:56,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.28 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 121.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 8.0 GB. [2020-11-09 15:38:56,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.06 ms. Allocated memory is still 151.0 MB. Free memory was 121.8 MB in the beginning and 118.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:38:56,043 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 151.0 MB. Free memory was 118.6 MB in the beginning and 116.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:38:56,044 INFO L168 Benchmark]: RCFGBuilder took 2955.39 ms. Allocated memory was 151.0 MB in the beginning and 182.5 MB in the end (delta: 31.5 MB). Free memory was 116.5 MB in the beginning and 78.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 73.9 MB. Max. memory is 8.0 GB. [2020-11-09 15:38:56,044 INFO L168 Benchmark]: TraceAbstraction took 39481.36 ms. Allocated memory was 182.5 MB in the beginning and 319.8 MB in the end (delta: 137.4 MB). Free memory was 78.3 MB in the beginning and 104.2 MB in the end (delta: -25.9 MB). Peak memory consumption was 111.4 MB. Max. memory is 8.0 GB. [2020-11-09 15:38:56,053 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.20 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 766.28 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 121.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 99.06 ms. Allocated memory is still 151.0 MB. Free memory was 121.8 MB in the beginning and 118.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 151.0 MB. Free memory was 118.6 MB in the beginning and 116.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2955.39 ms. Allocated memory was 151.0 MB in the beginning and 182.5 MB in the end (delta: 31.5 MB). Free memory was 116.5 MB in the beginning and 78.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 73.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 39481.36 ms. Allocated memory was 182.5 MB in the beginning and 319.8 MB in the end (delta: 137.4 MB). Free memory was 78.3 MB in the beginning and 104.2 MB in the end (delta: -25.9 MB). Peak memory consumption was 111.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: 28.8s, 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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=0, 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: 39.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.9s, HoareTripleCheckerStatistics: 324 SDtfs, 296 SDslu, 616 SDs, 0 SdLazy, 440 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 201 SyntacticMatches, 14 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 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.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 23835 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...