/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:40:44,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:40:44,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:40:45,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:40:45,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:40:45,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:40:45,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:40:45,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:40:45,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:40:45,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:40:45,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:40:45,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:40:45,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:40:45,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:40:45,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:40:45,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:40:45,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:40:45,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:40:45,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:40:45,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:40:45,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:40:45,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:40:45,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:40:45,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:40:45,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:40:45,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:40:45,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:40:45,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:40:45,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:40:45,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:40:45,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:40:45,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:40:45,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:40:45,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:40:45,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:40:45,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:40:45,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:40:45,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:40:45,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:40:45,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:40:45,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:40:45,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:40:45,081 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:40:45,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:40:45,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:40:45,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:40:45,083 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:40:45,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:40:45,083 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:40:45,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:40:45,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:40:45,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:40:45,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:40:45,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:40:45,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:40:45,085 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:40:45,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:40:45,085 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:40:45,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:40:45,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:40:45,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:40:45,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:40:45,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:40:45,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:40:45,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:40:45,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:40:45,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:40:45,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:40:45,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:40:45,087 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:40:45,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:40:45,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:40:45,088 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:40:45,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:40:45,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:40:45,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:40:45,395 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:40:45,395 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:40:45,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-22 00:40:45,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2208293/8bffaebaa87140cfa2d336d39c4ea653/FLAG3ebad599f [2020-10-22 00:40:45,883 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:40:45,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-22 00:40:45,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2208293/8bffaebaa87140cfa2d336d39c4ea653/FLAG3ebad599f [2020-10-22 00:40:46,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2208293/8bffaebaa87140cfa2d336d39c4ea653 [2020-10-22 00:40:46,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:40:46,202 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:40:46,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:40:46,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:40:46,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:40:46,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:46,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234a6391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46, skipping insertion in model container [2020-10-22 00:40:46,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:46,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:40:46,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:40:46,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:40:46,843 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:40:46,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:40:46,970 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:40:46,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46 WrapperNode [2020-10-22 00:40:46,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:40:46,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:40:46,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:40:46,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:40:46,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:40:47,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:40:47,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:40:47,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:40:47,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (1/1) ... [2020-10-22 00:40:47,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:40:47,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:40:47,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:40:47,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:40:47,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (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-10-22 00:40:47,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:40:47,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:40:47,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:40:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:40:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:40:47,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:40:47,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:40:47,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:40:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:40:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:40:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:40:47,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:40:47,170 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:40:49,149 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:40:49,149 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:40:49,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:40:49 BoogieIcfgContainer [2020-10-22 00:40:49,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:40:49,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:40:49,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:40:49,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:40:49,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:40:46" (1/3) ... [2020-10-22 00:40:49,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165f1b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:40:49, skipping insertion in model container [2020-10-22 00:40:49,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:40:46" (2/3) ... [2020-10-22 00:40:49,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165f1b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:40:49, skipping insertion in model container [2020-10-22 00:40:49,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:40:49" (3/3) ... [2020-10-22 00:40:49,160 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2020-10-22 00:40:49,172 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:40:49,172 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:40:49,179 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:40:49,180 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:40:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,211 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,211 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,221 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:40:49,230 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:40:49,244 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 00:40:49,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:40:49,264 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:40:49,264 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:40:49,264 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:40:49,264 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:40:49,264 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:40:49,265 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:40:49,265 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:40:49,277 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:40:49,278 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-22 00:40:49,281 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-22 00:40:49,283 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-22 00:40:49,325 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-22 00:40:49,325 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:40:49,330 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-22 00:40:49,332 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-22 00:40:49,635 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:40:50,132 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-22 00:40:51,959 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-22 00:40:52,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:40:52,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:52,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 00:40:52,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:53,049 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-10-22 00:40:54,077 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-10-22 00:40:54,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-22 00:40:54,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:54,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 00:40:54,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:40:54,929 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 104 [2020-10-22 00:40:55,413 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-22 00:40:55,724 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-22 00:40:55,834 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-22 00:40:56,172 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-22 00:40:56,433 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-22 00:40:56,891 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-22 00:40:57,198 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-22 00:40:57,542 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-22 00:40:57,705 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-22 00:40:57,710 INFO L131 LiptonReduction]: Checked pairs total: 2421 [2020-10-22 00:40:57,710 INFO L133 LiptonReduction]: Total number of compositions: 77 [2020-10-22 00:40:57,717 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-22 00:40:57,734 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-22 00:40:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-22 00:40:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 00:40:57,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:57,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 00:40:57,744 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-10-22 00:40:57,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:57,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79667580] [2020-10-22 00:40:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:57,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79667580] [2020-10-22 00:40:57,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:57,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:57,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686617887] [2020-10-22 00:40:58,000 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:58,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:58,013 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 00:40:58,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:58,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:58,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:58,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:58,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:58,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:58,030 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-22 00:40:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:58,107 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-22 00:40:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:58,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 00:40:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:58,119 INFO L225 Difference]: With dead ends: 137 [2020-10-22 00:40:58,119 INFO L226 Difference]: Without dead ends: 112 [2020-10-22 00:40:58,121 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-10-22 00:40:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-22 00:40:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-22 00:40:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-22 00:40:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-22 00:40:58,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-22 00:40:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:58,172 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-22 00:40:58,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-22 00:40:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:40:58,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:58,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:58,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:40:58,174 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-10-22 00:40:58,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:58,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713408350] [2020-10-22 00:40:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:58,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713408350] [2020-10-22 00:40:58,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:58,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:58,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734397165] [2020-10-22 00:40:58,296 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:58,297 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:58,299 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:40:58,299 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:58,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:58,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:58,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:58,302 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-22 00:40:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:58,371 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-22 00:40:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:58,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:40:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:58,374 INFO L225 Difference]: With dead ends: 111 [2020-10-22 00:40:58,374 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 00:40:58,375 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-10-22 00:40:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 00:40:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-22 00:40:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-22 00:40:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-22 00:40:58,387 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-22 00:40:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:58,388 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-22 00:40:58,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-22 00:40:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:40:58,389 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:58,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:58,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:40:58,389 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:58,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:58,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-10-22 00:40:58,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:58,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130693769] [2020-10-22 00:40:58,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:58,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130693769] [2020-10-22 00:40:58,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:58,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:58,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512597164] [2020-10-22 00:40:58,493 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:58,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:58,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 16 transitions. [2020-10-22 00:40:58,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:58,626 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:58,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:58,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:58,628 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 3 states. [2020-10-22 00:40:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:58,657 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-22 00:40:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:58,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-22 00:40:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:58,660 INFO L225 Difference]: With dead ends: 107 [2020-10-22 00:40:58,660 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 00:40:58,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-22 00:40:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 00:40:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-22 00:40:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:40:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-22 00:40:58,670 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-22 00:40:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:58,671 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-22 00:40:58,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-22 00:40:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:40:58,672 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:58,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:58,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:40:58,673 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1701307072, now seen corresponding path program 1 times [2020-10-22 00:40:58,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:58,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007710005] [2020-10-22 00:40:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:58,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007710005] [2020-10-22 00:40:58,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:58,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:40:58,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17054400] [2020-10-22 00:40:58,770 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:58,771 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:58,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-22 00:40:58,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:58,773 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:58,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:40:58,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:40:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:40:58,774 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 4 states. [2020-10-22 00:40:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:58,817 INFO L93 Difference]: Finished difference Result 108 states and 243 transitions. [2020-10-22 00:40:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:40:58,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-22 00:40:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:58,821 INFO L225 Difference]: With dead ends: 108 [2020-10-22 00:40:58,821 INFO L226 Difference]: Without dead ends: 108 [2020-10-22 00:40:58,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:40:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-22 00:40:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-10-22 00:40:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-22 00:40:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 243 transitions. [2020-10-22 00:40:58,831 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 243 transitions. Word has length 8 [2020-10-22 00:40:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:58,831 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 243 transitions. [2020-10-22 00:40:58,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:40:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 243 transitions. [2020-10-22 00:40:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:40:58,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:58,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:58,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:40:58,833 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1701345202, now seen corresponding path program 2 times [2020-10-22 00:40:58,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:58,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511952831] [2020-10-22 00:40:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:58,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511952831] [2020-10-22 00:40:58,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:58,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:40:58,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [509471050] [2020-10-22 00:40:58,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:58,889 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:58,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 10 transitions. [2020-10-22 00:40:58,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:58,905 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:58,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:58,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:58,906 INFO L87 Difference]: Start difference. First operand 108 states and 243 transitions. Second operand 3 states. [2020-10-22 00:40:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:58,914 INFO L93 Difference]: Finished difference Result 107 states and 240 transitions. [2020-10-22 00:40:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:58,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-22 00:40:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:58,916 INFO L225 Difference]: With dead ends: 107 [2020-10-22 00:40:58,916 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 00:40:58,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-22 00:40:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 00:40:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2020-10-22 00:40:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-22 00:40:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-10-22 00:40:58,924 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-10-22 00:40:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:58,924 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-10-22 00:40:58,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-10-22 00:40:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:40:58,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:58,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:58,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:40:58,926 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-10-22 00:40:58,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:58,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276311119] [2020-10-22 00:40:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:59,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276311119] [2020-10-22 00:40:59,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:59,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:40:59,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492140262] [2020-10-22 00:40:59,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:59,019 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:59,021 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-10-22 00:40:59,022 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:59,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:59,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:40:59,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:59,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:40:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:40:59,178 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-10-22 00:40:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:59,258 INFO L93 Difference]: Finished difference Result 103 states and 229 transitions. [2020-10-22 00:40:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:40:59,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:40:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:59,260 INFO L225 Difference]: With dead ends: 103 [2020-10-22 00:40:59,260 INFO L226 Difference]: Without dead ends: 103 [2020-10-22 00:40:59,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-22 00:40:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-22 00:40:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-22 00:40:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-10-22 00:40:59,267 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-10-22 00:40:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:59,268 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-10-22 00:40:59,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:40:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-10-22 00:40:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:40:59,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:59,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:59,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:40:59,269 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash 433034188, now seen corresponding path program 1 times [2020-10-22 00:40:59,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:59,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215795011] [2020-10-22 00:40:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:59,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215795011] [2020-10-22 00:40:59,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:59,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:40:59,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876777761] [2020-10-22 00:40:59,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:59,391 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:59,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 00:40:59,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:59,533 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2409#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-10-22 00:40:59,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:40:59,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:59,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:40:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:59,535 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 6 states. [2020-10-22 00:40:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:59,610 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2020-10-22 00:40:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:40:59,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-22 00:40:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:59,612 INFO L225 Difference]: With dead ends: 109 [2020-10-22 00:40:59,613 INFO L226 Difference]: Without dead ends: 109 [2020-10-22 00:40:59,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:40:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-22 00:40:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-22 00:40:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:40:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 236 transitions. [2020-10-22 00:40:59,619 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 236 transitions. Word has length 10 [2020-10-22 00:40:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:59,619 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 236 transitions. [2020-10-22 00:40:59,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:40:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 236 transitions. [2020-10-22 00:40:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:40:59,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:59,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:59,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:40:59,626 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-10-22 00:40:59,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:59,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315884240] [2020-10-22 00:40:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:59,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-10-22 00:40:59,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315884240] [2020-10-22 00:40:59,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:59,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:40:59,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145749534] [2020-10-22 00:40:59,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:59,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:59,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:40:59,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:40:59,677 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:40:59,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:40:59,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:40:59,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:40:59,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:40:59,678 INFO L87 Difference]: Start difference. First operand 107 states and 236 transitions. Second operand 3 states. [2020-10-22 00:40:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:40:59,688 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-10-22 00:40:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:40:59,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:40:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:40:59,690 INFO L225 Difference]: With dead ends: 153 [2020-10-22 00:40:59,691 INFO L226 Difference]: Without dead ends: 111 [2020-10-22 00:40:59,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-22 00:40:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-22 00:40:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2020-10-22 00:40:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-22 00:40:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-22 00:40:59,696 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-22 00:40:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:40:59,697 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-22 00:40:59,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:40:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-22 00:40:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:40:59,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:40:59,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:40:59,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:40:59,698 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:40:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:40:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-10-22 00:40:59,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:40:59,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514950206] [2020-10-22 00:40:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:40:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:40:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:40:59,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514950206] [2020-10-22 00:40:59,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:40:59,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:40:59,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132638299] [2020-10-22 00:40:59,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:40:59,850 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:40:59,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-22 00:40:59,854 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:00,012 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3105#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0))] [2020-10-22 00:41:00,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:41:00,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:41:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:00,035 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 7 states. [2020-10-22 00:41:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:00,152 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-10-22 00:41:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:00,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-22 00:41:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:00,154 INFO L225 Difference]: With dead ends: 119 [2020-10-22 00:41:00,154 INFO L226 Difference]: Without dead ends: 69 [2020-10-22 00:41:00,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:41:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-22 00:41:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-10-22 00:41:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-22 00:41:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-10-22 00:41:00,158 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-10-22 00:41:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:00,158 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-10-22 00:41:00,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:41:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-10-22 00:41:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:00,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:00,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:00,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:41:00,160 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-10-22 00:41:00,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:00,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487423541] [2020-10-22 00:41:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:00,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487423541] [2020-10-22 00:41:00,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:00,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:00,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1458322560] [2020-10-22 00:41:00,316 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:00,317 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:00,321 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 00:41:00,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:00,325 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:00,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:00,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:00,326 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-10-22 00:41:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:00,370 INFO L93 Difference]: Finished difference Result 78 states and 141 transitions. [2020-10-22 00:41:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:41:00,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:41:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:00,371 INFO L225 Difference]: With dead ends: 78 [2020-10-22 00:41:00,372 INFO L226 Difference]: Without dead ends: 61 [2020-10-22 00:41:00,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-22 00:41:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-22 00:41:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-22 00:41:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2020-10-22 00:41:00,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 11 [2020-10-22 00:41:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:00,375 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 118 transitions. [2020-10-22 00:41:00,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 118 transitions. [2020-10-22 00:41:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:00,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:00,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:00,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:41:00,376 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1626460929, now seen corresponding path program 2 times [2020-10-22 00:41:00,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:00,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416060325] [2020-10-22 00:41:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:00,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416060325] [2020-10-22 00:41:00,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:00,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:41:00,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983424769] [2020-10-22 00:41:00,545 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:00,547 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:00,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-22 00:41:00,552 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:00,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:00,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:00,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:00,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:00,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:00,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:00,648 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:00,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:00,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,694 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:00,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,724 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:41:00,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:00,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:00,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,834 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:00,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,897 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:00,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:00,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 00:41:00,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:01,134 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3568#(or (and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 ULTIMATE.start_assume_abort_if_not_~cond)) (not (= (mod ~x$w_buff0_used~0 256) 0))), 3567#(and (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= ~x$w_buff0_used~0 0)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 ULTIMATE.start_assume_abort_if_not_~cond))] [2020-10-22 00:41:01,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:41:01,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:41:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:01,136 INFO L87 Difference]: Start difference. First operand 61 states and 118 transitions. Second operand 8 states. [2020-10-22 00:41:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:01,322 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2020-10-22 00:41:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:41:01,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-10-22 00:41:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:01,323 INFO L225 Difference]: With dead ends: 63 [2020-10-22 00:41:01,323 INFO L226 Difference]: Without dead ends: 46 [2020-10-22 00:41:01,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:41:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-22 00:41:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-22 00:41:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-22 00:41:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2020-10-22 00:41:01,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 11 [2020-10-22 00:41:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:01,327 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2020-10-22 00:41:01,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:41:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2020-10-22 00:41:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:41:01,328 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:01,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:01,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:41:01,328 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-10-22 00:41:01,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:01,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609495493] [2020-10-22 00:41:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:01,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609495493] [2020-10-22 00:41:01,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:01,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:01,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1165315228] [2020-10-22 00:41:01,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:01,401 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:01,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-10-22 00:41:01,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:01,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:01,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:01,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:01,464 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 5 states. [2020-10-22 00:41:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:01,517 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-10-22 00:41:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:01,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 00:41:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:01,518 INFO L225 Difference]: With dead ends: 34 [2020-10-22 00:41:01,518 INFO L226 Difference]: Without dead ends: 21 [2020-10-22 00:41:01,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-22 00:41:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-22 00:41:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-22 00:41:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-22 00:41:01,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-10-22 00:41:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:01,521 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-22 00:41:01,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-22 00:41:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:41:01,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:01,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:01,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:41:01,522 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-10-22 00:41:01,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:01,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775907618] [2020-10-22 00:41:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:41:01,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:41:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:41:01,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:41:01,685 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:41:01,686 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:41:01,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:41:01,687 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:41:01,698 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In-130372575 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-130372575 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-130372575 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-130372575 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~x$w_buff0~0_In-130372575 ~x~0_Out-130372575)) (and .cse2 (or (and (= ~x~0_In-130372575 ~x~0_Out-130372575) .cse3) (and .cse4 .cse5 (= ~x$w_buff1~0_In-130372575 ~x~0_Out-130372575))))) (= ~x$r_buff1_thd0~0_Out-130372575 ~x$r_buff1_thd0~0_In-130372575) (or (and .cse3 (= ~x$w_buff1_used~0_In-130372575 ~x$w_buff1_used~0_Out-130372575)) (and .cse4 (= ~x$w_buff1_used~0_Out-130372575 0) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-130372575 0)) (or (and .cse0 .cse1 (= 0 ~x$w_buff0_used~0_Out-130372575)) (and (= ~x$w_buff0_used~0_In-130372575 ~x$w_buff0_used~0_Out-130372575) .cse2)) (= ~x$r_buff0_thd0~0_Out-130372575 ~x$r_buff0_thd0~0_In-130372575)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-130372575, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-130372575, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-130372575, ~x$w_buff1~0=~x$w_buff1~0_In-130372575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-130372575, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-130372575, ~x~0=~x~0_In-130372575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-130372575} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-130372575, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-130372575, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-130372575|, ~x$w_buff1~0=~x$w_buff1~0_In-130372575, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-130372575|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-130372575, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-130372575, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-130372575|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-130372575|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-130372575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-130372575, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-130372575|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-130372575, ~x~0=~x~0_Out-130372575} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-22 00:41:01,707 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,708 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-10-22 00:41:01,714 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,715 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,715 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,715 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,716 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,717 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,717 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,718 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,718 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:01,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:01,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:41:01 BasicIcfg [2020-10-22 00:41:01,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:41:01,814 INFO L168 Benchmark]: Toolchain (without parser) took 15616.57 ms. Allocated memory was 141.6 MB in the beginning and 340.3 MB in the end (delta: 198.7 MB). Free memory was 102.4 MB in the beginning and 284.4 MB in the end (delta: -182.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:01,815 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:41:01,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.51 ms. Allocated memory was 141.6 MB in the beginning and 208.7 MB in the end (delta: 67.1 MB). Free memory was 101.6 MB in the beginning and 161.8 MB in the end (delta: -60.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:01,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.48 ms. Allocated memory is still 208.7 MB. Free memory was 161.8 MB in the beginning and 158.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:01,819 INFO L168 Benchmark]: Boogie Preprocessor took 48.50 ms. Allocated memory is still 208.7 MB. Free memory was 158.4 MB in the beginning and 156.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:01,820 INFO L168 Benchmark]: RCFGBuilder took 2057.70 ms. Allocated memory was 208.7 MB in the beginning and 242.7 MB in the end (delta: 34.1 MB). Free memory was 156.4 MB in the beginning and 173.6 MB in the end (delta: -17.2 MB). Peak memory consumption was 90.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:01,820 INFO L168 Benchmark]: TraceAbstraction took 12659.54 ms. Allocated memory was 242.7 MB in the beginning and 340.3 MB in the end (delta: 97.5 MB). Free memory was 173.6 MB in the beginning and 284.4 MB in the end (delta: -110.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-22 00:41:01,830 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.18 ms. Allocated memory is still 141.6 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.51 ms. Allocated memory was 141.6 MB in the beginning and 208.7 MB in the end (delta: 67.1 MB). Free memory was 101.6 MB in the beginning and 161.8 MB in the end (delta: -60.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.48 ms. Allocated memory is still 208.7 MB. Free memory was 161.8 MB in the beginning and 158.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.50 ms. Allocated memory is still 208.7 MB. Free memory was 158.4 MB in the beginning and 156.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2057.70 ms. Allocated memory was 208.7 MB in the beginning and 242.7 MB in the end (delta: 34.1 MB). Free memory was 156.4 MB in the beginning and 173.6 MB in the end (delta: -17.2 MB). Peak memory consumption was 90.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12659.54 ms. Allocated memory was 242.7 MB in the beginning and 340.3 MB in the end (delta: 97.5 MB). Free memory was 173.6 MB in the beginning and 284.4 MB in the end (delta: -110.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 566 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 77 TotalNumberOfCompositions, 2421 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2483; [L791] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2484; [L793] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 177 SDtfs, 117 SDslu, 177 SDs, 0 SdLazy, 229 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 5903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...