/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:50:37,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:50:37,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:50:37,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:50:37,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:50:37,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:50:37,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:50:37,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:50:37,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:50:37,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:50:37,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:50:37,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:50:37,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:50:37,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:50:37,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:50:37,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:50:37,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:50:37,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:50:37,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:50:37,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:50:37,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:50:37,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:50:37,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:50:37,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:50:37,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:50:37,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:50:37,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:50:37,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:50:37,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:50:37,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:50:37,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:50:37,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:50:37,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:50:37,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:50:37,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:50:37,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:50:37,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:50:37,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:50:37,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:50:37,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:50:37,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:50:37,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:50:37,196 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:50:37,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:50:37,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:50:37,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:50:37,199 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:50:37,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:50:37,200 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:50:37,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:50:37,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:50:37,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:50:37,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:50:37,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:50:37,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:50:37,202 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:50:37,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:50:37,203 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:50:37,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:50:37,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:50:37,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:50:37,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:50:37,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:50:37,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:50:37,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:50:37,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:50:37,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:50:37,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:50:37,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:50:37,206 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:50:37,207 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:50:37,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:50:37,207 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 16:50:37,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:50:37,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:50:37,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:50:37,713 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:50:37,714 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:50:37,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-11-09 16:50:37,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb3cef40/5da7fc5875c9430ea8bfe34dcba77485/FLAGb8ce2229b [2020-11-09 16:50:38,598 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:50:38,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-11-09 16:50:38,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb3cef40/5da7fc5875c9430ea8bfe34dcba77485/FLAGb8ce2229b [2020-11-09 16:50:38,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb3cef40/5da7fc5875c9430ea8bfe34dcba77485 [2020-11-09 16:50:38,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:50:38,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:50:38,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:50:38,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:50:38,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:50:38,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:38" (1/1) ... [2020-11-09 16:50:38,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d3754d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:38, skipping insertion in model container [2020-11-09 16:50:38,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:38" (1/1) ... [2020-11-09 16:50:38,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:50:38,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:50:39,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:50:39,336 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:50:39,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:50:39,602 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:50:39,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39 WrapperNode [2020-11-09 16:50:39,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:50:39,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:50:39,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:50:39,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:50:39,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:50:39,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:50:39,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:50:39,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:50:39,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (1/1) ... [2020-11-09 16:50:39,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:50:39,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:50:39,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:50:39,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:50:39,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (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 16:50:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:50:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:50:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:50:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:50:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:50:39,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:50:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:50:39,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:50:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:50:39,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:50:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:50:39,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:50:39,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:50:39,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:50:39,853 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 16:50:41,943 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:50:41,943 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:50:41,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:41 BoogieIcfgContainer [2020-11-09 16:50:41,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:50:41,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:50:41,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:50:41,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:50:41,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:50:38" (1/3) ... [2020-11-09 16:50:41,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d626067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:41, skipping insertion in model container [2020-11-09 16:50:41,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:39" (2/3) ... [2020-11-09 16:50:41,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d626067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:41, skipping insertion in model container [2020-11-09 16:50:41,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:41" (3/3) ... [2020-11-09 16:50:41,954 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2020-11-09 16:50:41,969 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:50:41,969 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:50:41,973 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:50:41,974 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:50:42,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,010 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,010 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,010 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,011 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,012 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,012 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,013 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,013 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,018 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,018 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,020 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,020 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,021 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,022 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,029 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,030 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:50:42,042 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:50:42,055 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 16:50:42,078 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:50:42,078 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:50:42,078 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:50:42,078 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:50:42,079 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:50:42,079 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:50:42,079 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:50:42,079 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:50:42,092 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:50:42,093 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-09 16:50:42,097 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-09 16:50:42,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-11-09 16:50:42,149 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-11-09 16:50:42,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:50:42,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-09 16:50:42,158 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2020-11-09 16:50:42,821 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-11-09 16:50:43,054 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 16:50:45,029 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-11-09 16:50:45,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 16:50:45,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:45,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:50:45,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:45,885 WARN L194 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-11-09 16:50:48,176 WARN L194 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2020-11-09 16:50:48,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:50:48,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,226 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 16:50:48,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 16:50:48,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:50:48,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:50:48,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:50:48,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:50:48,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:50:48,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:48,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:50:48,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:50:48,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:50:48,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:52,089 WARN L194 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 365 DAG size of output: 267 [2020-11-09 16:50:52,816 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 16:50:52,924 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:50:53,544 WARN L194 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-11-09 16:50:53,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:50:53,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:50:54,020 WARN L194 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 16:50:54,379 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 16:50:54,550 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 16:50:56,128 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:50:56,261 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:50:56,396 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:50:56,521 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 16:50:56,984 WARN L194 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 16:50:57,223 WARN L194 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:50:57,695 WARN L194 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 16:50:57,894 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 16:50:57,900 INFO L131 LiptonReduction]: Checked pairs total: 5760 [2020-11-09 16:50:57,900 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-11-09 16:50:57,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-11-09 16:50:57,981 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1030 states. [2020-11-09 16:50:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states. [2020-11-09 16:50:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 16:50:57,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:50:57,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:50:57,991 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:50:58,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:50:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash -141166123, now seen corresponding path program 1 times [2020-11-09 16:50:58,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:50:58,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272794761] [2020-11-09 16:50:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:50:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:50:58,390 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 16:50:58,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272794761] [2020-11-09 16:50:58,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:50:58,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:50:58,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991170071] [2020-11-09 16:50:58,394 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:50:58,397 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:50:58,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 16:50:58,414 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:50:58,419 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:50:58,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:50:58,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:50:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:50:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:50:58,439 INFO L87 Difference]: Start difference. First operand 1030 states. Second operand 3 states. [2020-11-09 16:50:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:50:58,520 INFO L93 Difference]: Finished difference Result 890 states and 2840 transitions. [2020-11-09 16:50:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:50:58,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 16:50:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:50:58,555 INFO L225 Difference]: With dead ends: 890 [2020-11-09 16:50:58,556 INFO L226 Difference]: Without dead ends: 650 [2020-11-09 16:50:58,560 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 16:50:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-09 16:50:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-09 16:50:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-09 16:50:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-11-09 16:50:58,723 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2020-11-09 16:50:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:50:58,726 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-11-09 16:50:58,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:50:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-11-09 16:50:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 16:50:58,729 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:50:58,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:50:58,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:50:58,729 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:50:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:50:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash -704607506, now seen corresponding path program 1 times [2020-11-09 16:50:58,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:50:58,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289338896] [2020-11-09 16:50:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:50:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:50:58,926 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 16:50:58,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289338896] [2020-11-09 16:50:58,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:50:58,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:50:58,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [116813125] [2020-11-09 16:50:58,929 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:50:58,931 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:50:58,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 16:50:58,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:50:58,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:50:58,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:50:58,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:50:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:50:58,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:50:58,944 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states. [2020-11-09 16:50:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:50:59,056 INFO L93 Difference]: Finished difference Result 730 states and 2192 transitions. [2020-11-09 16:50:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:50:59,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 16:50:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:50:59,064 INFO L225 Difference]: With dead ends: 730 [2020-11-09 16:50:59,064 INFO L226 Difference]: Without dead ends: 610 [2020-11-09 16:50:59,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 16:50:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-11-09 16:50:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-11-09 16:50:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-09 16:50:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1886 transitions. [2020-11-09 16:50:59,117 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1886 transitions. Word has length 10 [2020-11-09 16:50:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:50:59,118 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1886 transitions. [2020-11-09 16:50:59,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:50:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1886 transitions. [2020-11-09 16:50:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:50:59,129 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:50:59,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:50:59,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:50:59,130 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:50:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:50:59,131 INFO L82 PathProgramCache]: Analyzing trace with hash -368046851, now seen corresponding path program 1 times [2020-11-09 16:50:59,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:50:59,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722860994] [2020-11-09 16:50:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:50:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:50:59,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 16:50:59,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722860994] [2020-11-09 16:50:59,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:50:59,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:50:59,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066113087] [2020-11-09 16:50:59,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:50:59,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:50:59,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 13 transitions. [2020-11-09 16:50:59,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:50:59,319 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:50:59,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:50:59,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:50:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:50:59,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:50:59,321 INFO L87 Difference]: Start difference. First operand 610 states and 1886 transitions. Second operand 4 states. [2020-11-09 16:50:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:50:59,356 INFO L93 Difference]: Finished difference Result 670 states and 1999 transitions. [2020-11-09 16:50:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:50:59,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 16:50:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:50:59,362 INFO L225 Difference]: With dead ends: 670 [2020-11-09 16:50:59,362 INFO L226 Difference]: Without dead ends: 570 [2020-11-09 16:50:59,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 16:50:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-11-09 16:50:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-11-09 16:50:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-11-09 16:50:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions. [2020-11-09 16:50:59,387 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 11 [2020-11-09 16:50:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:50:59,388 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions. [2020-11-09 16:50:59,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:50:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions. [2020-11-09 16:50:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:50:59,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:50:59,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:50:59,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:50:59,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:50:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:50:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1473373074, now seen corresponding path program 1 times [2020-11-09 16:50:59,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:50:59,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976223939] [2020-11-09 16:50:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:50:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:50:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:50:59,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976223939] [2020-11-09 16:50:59,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:50:59,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:50:59,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101508928] [2020-11-09 16:50:59,489 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:50:59,491 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:50:59,494 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 18 transitions. [2020-11-09 16:50:59,494 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:50:59,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:50:59,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:50:59,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:50:59,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:50:59,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:50:59,502 INFO L87 Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand 4 states. [2020-11-09 16:50:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:50:59,543 INFO L93 Difference]: Finished difference Result 634 states and 1876 transitions. [2020-11-09 16:50:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:50:59,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 16:50:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:50:59,549 INFO L225 Difference]: With dead ends: 634 [2020-11-09 16:50:59,549 INFO L226 Difference]: Without dead ends: 554 [2020-11-09 16:50:59,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:50:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-11-09 16:50:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2020-11-09 16:50:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-11-09 16:50:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1684 transitions. [2020-11-09 16:50:59,603 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1684 transitions. Word has length 12 [2020-11-09 16:50:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:50:59,603 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 1684 transitions. [2020-11-09 16:50:59,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:50:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1684 transitions. [2020-11-09 16:50:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:50:59,605 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:50:59,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:50:59,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:50:59,606 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:50:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:50:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2143714500, now seen corresponding path program 1 times [2020-11-09 16:50:59,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:50:59,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383917] [2020-11-09 16:50:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:50:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:50:59,807 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 16:50:59,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383917] [2020-11-09 16:50:59,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:50:59,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:50:59,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259216714] [2020-11-09 16:50:59,808 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:50:59,810 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:50:59,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 40 transitions. [2020-11-09 16:50:59,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:50:59,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:50:59,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:50:59,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:50:59,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:50:59,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:50:59,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:50:59,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:50:59,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:00,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:00,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:51:00,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:00,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:51:00,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:51:00,018 INFO L87 Difference]: Start difference. First operand 554 states and 1684 transitions. Second operand 6 states. [2020-11-09 16:51:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:00,143 INFO L93 Difference]: Finished difference Result 650 states and 1924 transitions. [2020-11-09 16:51:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:51:00,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-09 16:51:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:00,148 INFO L225 Difference]: With dead ends: 650 [2020-11-09 16:51:00,149 INFO L226 Difference]: Without dead ends: 578 [2020-11-09 16:51:00,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-11-09 16:51:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2020-11-09 16:51:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-11-09 16:51:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1750 transitions. [2020-11-09 16:51:00,174 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1750 transitions. Word has length 13 [2020-11-09 16:51:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:00,174 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 1750 transitions. [2020-11-09 16:51:00,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:51:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1750 transitions. [2020-11-09 16:51:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:51:00,176 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:00,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:00,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:51:00,176 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2139908940, now seen corresponding path program 2 times [2020-11-09 16:51:00,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:00,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915657996] [2020-11-09 16:51:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:51:00,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915657996] [2020-11-09 16:51:00,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:00,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:51:00,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884893177] [2020-11-09 16:51:00,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:00,337 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:00,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-11-09 16:51:00,341 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:00,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:51:00,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:00,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:51:00,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:00,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:00,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:51:00,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:51:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:51:00,400 INFO L87 Difference]: Start difference. First operand 578 states and 1750 transitions. Second operand 6 states. [2020-11-09 16:51:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:00,528 INFO L93 Difference]: Finished difference Result 626 states and 1836 transitions. [2020-11-09 16:51:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:51:00,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-09 16:51:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:00,534 INFO L225 Difference]: With dead ends: 626 [2020-11-09 16:51:00,534 INFO L226 Difference]: Without dead ends: 554 [2020-11-09 16:51:00,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-11-09 16:51:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 530. [2020-11-09 16:51:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-09 16:51:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1596 transitions. [2020-11-09 16:51:00,554 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1596 transitions. Word has length 13 [2020-11-09 16:51:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:00,555 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1596 transitions. [2020-11-09 16:51:00,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:51:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1596 transitions. [2020-11-09 16:51:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:51:00,556 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:00,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:00,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:51:00,557 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash -851135848, now seen corresponding path program 1 times [2020-11-09 16:51:00,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:00,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336599675] [2020-11-09 16:51:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:51:00,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336599675] [2020-11-09 16:51:00,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:00,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:51:00,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963930209] [2020-11-09 16:51:00,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:00,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:00,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 52 transitions. [2020-11-09 16:51:00,683 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:00,802 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13404#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 16:51:00,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:51:00,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:51:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:00,804 INFO L87 Difference]: Start difference. First operand 530 states and 1596 transitions. Second operand 8 states. [2020-11-09 16:51:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:00,941 INFO L93 Difference]: Finished difference Result 610 states and 1788 transitions. [2020-11-09 16:51:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:51:00,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 16:51:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:00,947 INFO L225 Difference]: With dead ends: 610 [2020-11-09 16:51:00,947 INFO L226 Difference]: Without dead ends: 554 [2020-11-09 16:51:00,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:51:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-11-09 16:51:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 538. [2020-11-09 16:51:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-11-09 16:51:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1606 transitions. [2020-11-09 16:51:00,968 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1606 transitions. Word has length 14 [2020-11-09 16:51:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:00,968 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1606 transitions. [2020-11-09 16:51:00,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:51:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1606 transitions. [2020-11-09 16:51:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:51:00,970 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:00,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:00,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:51:00,970 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -615473533, now seen corresponding path program 1 times [2020-11-09 16:51:00,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:00,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37347101] [2020-11-09 16:51:00,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:01,242 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 16:51:01,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37347101] [2020-11-09 16:51:01,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:01,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:51:01,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426627901] [2020-11-09 16:51:01,244 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:01,248 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:01,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-11-09 16:51:01,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:01,429 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:51:01,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:01,431 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:01,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:01,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:01,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:01,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:01,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:01,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:01,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:01,501 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15103#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-11-09 16:51:01,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 16:51:01,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 16:51:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:51:01,503 INFO L87 Difference]: Start difference. First operand 538 states and 1606 transitions. Second operand 9 states. [2020-11-09 16:51:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:01,778 INFO L93 Difference]: Finished difference Result 754 states and 2172 transitions. [2020-11-09 16:51:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 16:51:01,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-11-09 16:51:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:01,783 INFO L225 Difference]: With dead ends: 754 [2020-11-09 16:51:01,784 INFO L226 Difference]: Without dead ends: 634 [2020-11-09 16:51:01,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:51:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-11-09 16:51:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 586. [2020-11-09 16:51:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-11-09 16:51:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1722 transitions. [2020-11-09 16:51:01,808 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1722 transitions. Word has length 15 [2020-11-09 16:51:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:01,809 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 1722 transitions. [2020-11-09 16:51:01,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 16:51:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1722 transitions. [2020-11-09 16:51:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:51:01,811 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:01,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:01,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:51:01,811 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash -565655293, now seen corresponding path program 2 times [2020-11-09 16:51:01,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:01,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514325970] [2020-11-09 16:51:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:02,019 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 16:51:02,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514325970] [2020-11-09 16:51:02,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:02,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:51:02,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967131447] [2020-11-09 16:51:02,020 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:02,022 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:02,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 27 transitions. [2020-11-09 16:51:02,027 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:02,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:02,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:51:02,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:51:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:02,051 INFO L87 Difference]: Start difference. First operand 586 states and 1722 transitions. Second operand 8 states. [2020-11-09 16:51:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:02,300 INFO L93 Difference]: Finished difference Result 590 states and 1709 transitions. [2020-11-09 16:51:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:51:02,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 16:51:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:02,307 INFO L225 Difference]: With dead ends: 590 [2020-11-09 16:51:02,307 INFO L226 Difference]: Without dead ends: 558 [2020-11-09 16:51:02,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-09 16:51:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-11-09 16:51:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 482. [2020-11-09 16:51:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-09 16:51:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1408 transitions. [2020-11-09 16:51:02,325 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1408 transitions. Word has length 15 [2020-11-09 16:51:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:02,325 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1408 transitions. [2020-11-09 16:51:02,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:51:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1408 transitions. [2020-11-09 16:51:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:51:02,327 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:02,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:02,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:51:02,327 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1409204827, now seen corresponding path program 1 times [2020-11-09 16:51:02,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:02,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232694705] [2020-11-09 16:51:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:02,415 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 16:51:02,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232694705] [2020-11-09 16:51:02,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:02,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:51:02,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552677488] [2020-11-09 16:51:02,416 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:02,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:02,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions. [2020-11-09 16:51:02,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:02,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:02,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:02,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:02,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:02,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:02,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,551 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:02,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:02,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:02,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:02,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:51:02,764 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18610#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 16:51:02,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:51:02,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:02,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:51:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:51:02,766 INFO L87 Difference]: Start difference. First operand 482 states and 1408 transitions. Second operand 5 states. [2020-11-09 16:51:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:02,838 INFO L93 Difference]: Finished difference Result 334 states and 863 transitions. [2020-11-09 16:51:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:51:02,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 16:51:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:02,841 INFO L225 Difference]: With dead ends: 334 [2020-11-09 16:51:02,841 INFO L226 Difference]: Without dead ends: 214 [2020-11-09 16:51:02,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-11-09 16:51:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-11-09 16:51:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-11-09 16:51:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 478 transitions. [2020-11-09 16:51:02,849 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 478 transitions. Word has length 15 [2020-11-09 16:51:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:02,850 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 478 transitions. [2020-11-09 16:51:02,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:51:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 478 transitions. [2020-11-09 16:51:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:51:02,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:02,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:02,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:51:02,851 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1337391238, now seen corresponding path program 1 times [2020-11-09 16:51:02,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:02,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598940740] [2020-11-09 16:51:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:02,944 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 16:51:02,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598940740] [2020-11-09 16:51:02,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:02,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:51:02,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793460291] [2020-11-09 16:51:02,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:02,949 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:02,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 62 transitions. [2020-11-09 16:51:02,958 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:02,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:02,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:02,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:02,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:02,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:03,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:51:03,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:03,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:51:03,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:03,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:51:03,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:51:03,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:03,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:51:03,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:51:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:51:03,108 INFO L87 Difference]: Start difference. First operand 214 states and 478 transitions. Second operand 5 states. [2020-11-09 16:51:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:03,162 INFO L93 Difference]: Finished difference Result 285 states and 615 transitions. [2020-11-09 16:51:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:03,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-09 16:51:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:03,164 INFO L225 Difference]: With dead ends: 285 [2020-11-09 16:51:03,164 INFO L226 Difference]: Without dead ends: 127 [2020-11-09 16:51:03,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-09 16:51:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-09 16:51:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-09 16:51:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 244 transitions. [2020-11-09 16:51:03,171 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 244 transitions. Word has length 18 [2020-11-09 16:51:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:03,172 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 244 transitions. [2020-11-09 16:51:03,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:51:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 244 transitions. [2020-11-09 16:51:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:51:03,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:03,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:03,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:51:03,173 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash -717373716, now seen corresponding path program 2 times [2020-11-09 16:51:03,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:03,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915186367] [2020-11-09 16:51:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:03,240 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 16:51:03,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915186367] [2020-11-09 16:51:03,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:03,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:51:03,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378756770] [2020-11-09 16:51:03,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:03,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:03,248 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-11-09 16:51:03,249 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:03,251 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:51:03,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:51:03,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:51:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:51:03,253 INFO L87 Difference]: Start difference. First operand 127 states and 244 transitions. Second operand 4 states. [2020-11-09 16:51:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:03,281 INFO L93 Difference]: Finished difference Result 178 states and 326 transitions. [2020-11-09 16:51:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:51:03,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-09 16:51:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:03,283 INFO L225 Difference]: With dead ends: 178 [2020-11-09 16:51:03,283 INFO L226 Difference]: Without dead ends: 125 [2020-11-09 16:51:03,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 16:51:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-09 16:51:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2020-11-09 16:51:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-09 16:51:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 216 transitions. [2020-11-09 16:51:03,288 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 216 transitions. Word has length 18 [2020-11-09 16:51:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:03,288 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 216 transitions. [2020-11-09 16:51:03,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:51:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 216 transitions. [2020-11-09 16:51:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:51:03,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:03,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:51:03,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:51:03,289 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1155310386, now seen corresponding path program 1 times [2020-11-09 16:51:03,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:03,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474656454] [2020-11-09 16:51:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:51:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:51:03,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474656454] [2020-11-09 16:51:03,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:51:03,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:51:03,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989631874] [2020-11-09 16:51:03,427 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:51:03,431 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:51:03,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 41 transitions. [2020-11-09 16:51:03,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:51:03,487 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20357#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:51:03,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:51:03,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:51:03,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:51:03,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:51:03,489 INFO L87 Difference]: Start difference. First operand 121 states and 216 transitions. Second operand 7 states. [2020-11-09 16:51:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:51:03,554 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2020-11-09 16:51:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:51:03,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 16:51:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:51:03,555 INFO L225 Difference]: With dead ends: 99 [2020-11-09 16:51:03,555 INFO L226 Difference]: Without dead ends: 37 [2020-11-09 16:51:03,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:51:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-09 16:51:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-09 16:51:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-09 16:51:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-11-09 16:51:03,558 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2020-11-09 16:51:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:51:03,558 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-11-09 16:51:03,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:51:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-11-09 16:51:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:51:03,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:51:03,559 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, 1, 1] [2020-11-09 16:51:03,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:51:03,559 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:51:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:51:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1615855003, now seen corresponding path program 1 times [2020-11-09 16:51:03,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:51:03,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908597055] [2020-11-09 16:51:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:51:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:51:03,610 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:51:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:51:03,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:51:03,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:51:03,750 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:51:03,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:51:03,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:51:03 BasicIcfg [2020-11-09 16:51:03,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:51:03,889 INFO L168 Benchmark]: Toolchain (without parser) took 25052.10 ms. Allocated memory was 151.0 MB in the beginning and 406.8 MB in the end (delta: 255.9 MB). Free memory was 125.3 MB in the beginning and 214.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 167.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:03,890 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 124.7 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:51:03,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.80 ms. Allocated memory is still 151.0 MB. Free memory was 124.6 MB in the beginning and 122.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:03,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.05 ms. Allocated memory is still 151.0 MB. Free memory was 122.7 MB in the beginning and 119.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:03,892 INFO L168 Benchmark]: Boogie Preprocessor took 68.88 ms. Allocated memory is still 151.0 MB. Free memory was 119.5 MB in the beginning and 117.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:03,893 INFO L168 Benchmark]: RCFGBuilder took 2202.07 ms. Allocated memory was 151.0 MB in the beginning and 189.8 MB in the end (delta: 38.8 MB). Free memory was 117.4 MB in the beginning and 114.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 77.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:03,894 INFO L168 Benchmark]: TraceAbstraction took 21941.17 ms. Allocated memory was 189.8 MB in the beginning and 406.8 MB in the end (delta: 217.1 MB). Free memory was 114.0 MB in the beginning and 214.6 MB in the end (delta: -100.6 MB). Peak memory consumption was 116.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:51:03,897 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.29 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 124.7 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 759.80 ms. Allocated memory is still 151.0 MB. Free memory was 124.6 MB in the beginning and 122.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 67.05 ms. Allocated memory is still 151.0 MB. Free memory was 122.7 MB in the beginning and 119.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.88 ms. Allocated memory is still 151.0 MB. Free memory was 119.5 MB in the beginning and 117.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2202.07 ms. Allocated memory was 151.0 MB in the beginning and 189.8 MB in the end (delta: 38.8 MB). Free memory was 117.4 MB in the beginning and 114.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 77.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21941.17 ms. Allocated memory was 189.8 MB in the beginning and 406.8 MB in the end (delta: 217.1 MB). Free memory was 114.0 MB in the beginning and 214.6 MB in the end (delta: -100.6 MB). Peak memory consumption was 116.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1040 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 96 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.8s, 111 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5760 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; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1208; [L824] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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, z=0] [L825] 0 pthread_t t1209; [L826] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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, z=0] [L827] 0 pthread_t t1210; [L828] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix045_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.9s, HoareTripleCheckerStatistics: 411 SDtfs, 413 SDslu, 869 SDs, 0 SdLazy, 346 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030occurred 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, 13 MinimizatonAttempts, 168 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 14561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...