/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/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:21:50,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:21:50,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:21:50,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:21:50,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:21:50,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:21:50,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:21:50,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:21:50,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:21:50,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:21:50,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:21:50,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:21:50,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:21:50,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:21:50,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:21:50,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:21:50,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:21:50,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:21:50,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:21:50,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:21:50,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:21:50,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:21:50,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:21:50,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:21:50,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:21:50,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:21:50,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:21:50,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:21:50,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:21:50,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:21:50,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:21:50,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:21:50,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:21:50,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:21:50,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:21:50,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:21:50,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:21:50,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:21:50,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:21:50,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:21:50,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:21:50,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:21:51,029 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:21:51,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:21:51,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:21:51,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:21:51,033 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:21:51,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:21:51,033 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:21:51,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:21:51,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:21:51,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:21:51,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:21:51,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:21:51,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:21:51,036 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:21:51,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:21:51,036 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:21:51,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:21:51,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:21:51,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:21:51,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:21:51,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:21:51,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:21:51,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:21:51,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:21:51,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:21:51,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:21:51,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:21:51,039 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:21:51,039 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:21:51,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:21:51,039 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:21:51,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:21:51,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:21:51,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:21:51,379 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:21:51,380 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:21:51,380 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2020-10-16 13:21:51,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9fdc42b0e/b05b485c418e46e3bcc85a52e73742ff/FLAG8923373ed [2020-10-16 13:21:52,011 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:21:52,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2020-10-16 13:21:52,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9fdc42b0e/b05b485c418e46e3bcc85a52e73742ff/FLAG8923373ed [2020-10-16 13:21:52,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9fdc42b0e/b05b485c418e46e3bcc85a52e73742ff [2020-10-16 13:21:52,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:21:52,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:21:52,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:21:52,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:21:52,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:21:52,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:52,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634d4812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52, skipping insertion in model container [2020-10-16 13:21:52,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:52,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:21:52,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:21:52,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:21:52,817 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:21:52,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:21:52,954 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:21:52,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52 WrapperNode [2020-10-16 13:21:52,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:21:52,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:21:52,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:21:52,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:21:52,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:52,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:21:53,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:21:53,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:21:53,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:21:53,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... [2020-10-16 13:21:53,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:21:53,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:21:53,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:21:53,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:21:53,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 13:21:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:21:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:21:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:21:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:21:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:21:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:21:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:21:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:21:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:21:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:21:53,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:21:53,139 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:21:55,060 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:21:55,061 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:21:55,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:55 BoogieIcfgContainer [2020-10-16 13:21:55,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:21:55,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:21:55,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:21:55,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:21:55,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:21:52" (1/3) ... [2020-10-16 13:21:55,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fe51ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:55, skipping insertion in model container [2020-10-16 13:21:55,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:52" (2/3) ... [2020-10-16 13:21:55,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fe51ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:55, skipping insertion in model container [2020-10-16 13:21:55,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:55" (3/3) ... [2020-10-16 13:21:55,074 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2020-10-16 13:21:55,089 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:21:55,090 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:21:55,099 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:21:55,100 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:21:55,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,134 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,141 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,151 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,151 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,157 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,157 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:55,162 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:21:55,178 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 13:21:55,201 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:21:55,202 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:21:55,202 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:21:55,202 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:21:55,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:21:55,202 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:21:55,203 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:21:55,203 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:21:55,217 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:21:55,218 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-16 13:21:55,221 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-16 13:21:55,223 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 13:21:55,265 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 13:21:55,265 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:21:55,270 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 13:21:55,273 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-16 13:21:55,554 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-16 13:21:57,080 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 13:21:57,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:21:57,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:21:57,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 13:21:57,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:21:57,925 WARN L193 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 13:21:58,481 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 13:21:58,599 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 13:21:59,272 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-16 13:21:59,361 INFO L132 LiptonReduction]: Checked pairs total: 2462 [2020-10-16 13:21:59,361 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-16 13:21:59,368 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-16 13:21:59,390 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2020-10-16 13:21:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2020-10-16 13:21:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 13:21:59,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:59,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 13:21:59,401 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 861621042, now seen corresponding path program 1 times [2020-10-16 13:21:59,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:59,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521061663] [2020-10-16 13:21:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:59,707 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-16 13:21:59,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521061663] [2020-10-16 13:21:59,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:59,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:21:59,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616592605] [2020-10-16 13:21:59,712 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:59,715 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:59,729 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-16 13:21:59,730 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:59,734 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:59,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:21:59,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:21:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:59,754 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2020-10-16 13:21:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:59,812 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-16 13:21:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:21:59,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 13:21:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:59,827 INFO L225 Difference]: With dead ends: 187 [2020-10-16 13:21:59,827 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 13:21:59,828 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-16 13:21:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 13:21:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-16 13:21:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-16 13:21:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-16 13:21:59,882 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2020-10-16 13:21:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:59,883 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-16 13:21:59,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:21:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-16 13:21:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:21:59,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:59,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:59,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:21:59,885 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1829495527, now seen corresponding path program 1 times [2020-10-16 13:21:59,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:59,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115657164] [2020-10-16 13:21:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,054 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-16 13:22:00,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115657164] [2020-10-16 13:22:00,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:00,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [295936779] [2020-10-16 13:22:00,055 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,056 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,058 INFO L258 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-16 13:22:00,058 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,059 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:00,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:00,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:00,061 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 5 states. [2020-10-16 13:22:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:00,169 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2020-10-16 13:22:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:00,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-16 13:22:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:00,173 INFO L225 Difference]: With dead ends: 152 [2020-10-16 13:22:00,173 INFO L226 Difference]: Without dead ends: 127 [2020-10-16 13:22:00,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-16 13:22:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-16 13:22:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-16 13:22:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2020-10-16 13:22:00,186 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2020-10-16 13:22:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:00,187 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2020-10-16 13:22:00,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2020-10-16 13:22:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:22:00,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:00,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:00,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:22:00,189 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 879762521, now seen corresponding path program 1 times [2020-10-16 13:22:00,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:00,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278267624] [2020-10-16 13:22:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,315 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-16 13:22:00,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278267624] [2020-10-16 13:22:00,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:00,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928946262] [2020-10-16 13:22:00,317 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,318 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,321 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:22:00,322 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,322 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:00,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:00,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:00,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:00,324 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand 6 states. [2020-10-16 13:22:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:00,445 INFO L93 Difference]: Finished difference Result 139 states and 303 transitions. [2020-10-16 13:22:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:00,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-16 13:22:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:00,448 INFO L225 Difference]: With dead ends: 139 [2020-10-16 13:22:00,448 INFO L226 Difference]: Without dead ends: 119 [2020-10-16 13:22:00,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-16 13:22:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-16 13:22:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-16 13:22:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 268 transitions. [2020-10-16 13:22:00,458 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 268 transitions. Word has length 9 [2020-10-16 13:22:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:00,458 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 268 transitions. [2020-10-16 13:22:00,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 268 transitions. [2020-10-16 13:22:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:00,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:00,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:00,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:22:00,460 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash 935963072, now seen corresponding path program 1 times [2020-10-16 13:22:00,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:00,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648175499] [2020-10-16 13:22:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,588 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-16 13:22:00,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648175499] [2020-10-16 13:22:00,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:00,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275118502] [2020-10-16 13:22:00,590 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,591 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,594 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-16 13:22:00,594 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,625 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:00,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:00,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:00,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:00,627 INFO L87 Difference]: Start difference. First operand 119 states and 268 transitions. Second operand 7 states. [2020-10-16 13:22:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:00,738 INFO L93 Difference]: Finished difference Result 153 states and 339 transitions. [2020-10-16 13:22:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:22:00,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-16 13:22:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:00,743 INFO L225 Difference]: With dead ends: 153 [2020-10-16 13:22:00,744 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 13:22:00,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 13:22:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-16 13:22:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-16 13:22:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 310 transitions. [2020-10-16 13:22:00,755 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 310 transitions. Word has length 11 [2020-10-16 13:22:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:00,755 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 310 transitions. [2020-10-16 13:22:00,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 310 transitions. [2020-10-16 13:22:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:00,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:00,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:00,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:22:00,757 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:00,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1099232730, now seen corresponding path program 2 times [2020-10-16 13:22:00,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:00,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337002833] [2020-10-16 13:22:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:00,850 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-16 13:22:00,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337002833] [2020-10-16 13:22:00,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:00,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:00,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333569217] [2020-10-16 13:22:00,851 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:00,853 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:00,856 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-16 13:22:00,856 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:00,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:00,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:00,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:00,912 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:22:00,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:00,959 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2233#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-10-16 13:22:00,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:00,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:00,961 INFO L87 Difference]: Start difference. First operand 137 states and 310 transitions. Second operand 7 states. [2020-10-16 13:22:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,091 INFO L93 Difference]: Finished difference Result 157 states and 343 transitions. [2020-10-16 13:22:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:01,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-16 13:22:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,093 INFO L225 Difference]: With dead ends: 157 [2020-10-16 13:22:01,093 INFO L226 Difference]: Without dead ends: 143 [2020-10-16 13:22:01,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-16 13:22:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2020-10-16 13:22:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-16 13:22:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 295 transitions. [2020-10-16 13:22:01,102 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 295 transitions. Word has length 11 [2020-10-16 13:22:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,103 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 295 transitions. [2020-10-16 13:22:01,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 295 transitions. [2020-10-16 13:22:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:01,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:22:01,105 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash -657848166, now seen corresponding path program 1 times [2020-10-16 13:22:01,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765866469] [2020-10-16 13:22:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,194 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-16 13:22:01,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765866469] [2020-10-16 13:22:01,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:01,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085480740] [2020-10-16 13:22:01,196 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,199 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,201 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-16 13:22:01,201 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,201 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:01,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:01,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:01,203 INFO L87 Difference]: Start difference. First operand 133 states and 295 transitions. Second operand 4 states. [2020-10-16 13:22:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,222 INFO L93 Difference]: Finished difference Result 114 states and 213 transitions. [2020-10-16 13:22:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:01,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:22:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,224 INFO L225 Difference]: With dead ends: 114 [2020-10-16 13:22:01,224 INFO L226 Difference]: Without dead ends: 83 [2020-10-16 13:22:01,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-16 13:22:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-10-16 13:22:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-16 13:22:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 145 transitions. [2020-10-16 13:22:01,229 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 145 transitions. Word has length 11 [2020-10-16 13:22:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,229 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 145 transitions. [2020-10-16 13:22:01,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2020-10-16 13:22:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:22:01,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:22:01,231 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1314571888, now seen corresponding path program 1 times [2020-10-16 13:22:01,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137032322] [2020-10-16 13:22:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,331 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-16 13:22:01,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137032322] [2020-10-16 13:22:01,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:01,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874160137] [2020-10-16 13:22:01,332 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,337 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,342 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-16 13:22:01,342 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,343 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:01,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:01,344 INFO L87 Difference]: Start difference. First operand 83 states and 145 transitions. Second operand 5 states. [2020-10-16 13:22:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,380 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2020-10-16 13:22:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:01,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 13:22:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,382 INFO L225 Difference]: With dead ends: 59 [2020-10-16 13:22:01,382 INFO L226 Difference]: Without dead ends: 47 [2020-10-16 13:22:01,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-16 13:22:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-10-16 13:22:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-16 13:22:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-16 13:22:01,386 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2020-10-16 13:22:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,387 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-16 13:22:01,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-16 13:22:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:01,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:22:01,388 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash -299715963, now seen corresponding path program 1 times [2020-10-16 13:22:01,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455154501] [2020-10-16 13:22:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:01,553 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-16 13:22:01,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455154501] [2020-10-16 13:22:01,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:01,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:01,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486101875] [2020-10-16 13:22:01,554 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:01,557 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:01,564 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 38 transitions. [2020-10-16 13:22:01,564 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:01,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:01,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:01,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,675 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:01,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,687 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:01,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:01,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,802 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:01,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:01,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:01,854 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:01,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:01,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:01,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:01,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:01,855 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 7 states. [2020-10-16 13:22:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:01,978 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-10-16 13:22:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:22:01,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 13:22:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:01,980 INFO L225 Difference]: With dead ends: 60 [2020-10-16 13:22:01,980 INFO L226 Difference]: Without dead ends: 29 [2020-10-16 13:22:01,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-16 13:22:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-16 13:22:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-16 13:22:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-16 13:22:01,983 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-10-16 13:22:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:01,983 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-16 13:22:01,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-16 13:22:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:01,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:01,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:01,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:22:01,985 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:01,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1056418205, now seen corresponding path program 2 times [2020-10-16 13:22:01,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:01,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600043834] [2020-10-16 13:22:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:02,115 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-16 13:22:02,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600043834] [2020-10-16 13:22:02,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:02,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:02,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327545042] [2020-10-16 13:22:02,117 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:02,120 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:02,129 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 26 transitions. [2020-10-16 13:22:02,129 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:02,162 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3233#(and (= ~y~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-10-16 13:22:02,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:22:02,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:02,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:22:02,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:02,164 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 8 states. [2020-10-16 13:22:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:02,223 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-16 13:22:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:02,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 13:22:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:02,225 INFO L225 Difference]: With dead ends: 44 [2020-10-16 13:22:02,225 INFO L226 Difference]: Without dead ends: 25 [2020-10-16 13:22:02,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-16 13:22:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-16 13:22:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-16 13:22:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-16 13:22:02,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-16 13:22:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:02,228 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-16 13:22:02,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:22:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-16 13:22:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:02,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:02,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:02,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:22:02,229 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash -869615873, now seen corresponding path program 3 times [2020-10-16 13:22:02,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:02,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110582600] [2020-10-16 13:22:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:02,359 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-16 13:22:02,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110582600] [2020-10-16 13:22:02,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:02,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:02,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633702373] [2020-10-16 13:22:02,360 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:02,363 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:02,369 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-10-16 13:22:02,369 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:02,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:22:02,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:02,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,387 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:02,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:02,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:02,410 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:02,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,437 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:02,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,486 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:02,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,585 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:02,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:02,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:02,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:02,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:02,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:03,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,083 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:03,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,090 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:03,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,184 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:03,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:03,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:03,299 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:03,301 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:03,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:03,325 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:03,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:03,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:03,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:03,326 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 7 states. [2020-10-16 13:22:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:03,471 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-16 13:22:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:22:03,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 13:22:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:03,473 INFO L225 Difference]: With dead ends: 34 [2020-10-16 13:22:03,473 INFO L226 Difference]: Without dead ends: 21 [2020-10-16 13:22:03,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-16 13:22:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-16 13:22:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-16 13:22:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-16 13:22:03,476 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-16 13:22:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:03,477 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-16 13:22:03,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-16 13:22:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:03,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:03,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:03,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:22:03,480 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1239204549, now seen corresponding path program 4 times [2020-10-16 13:22:03,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:03,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404022946] [2020-10-16 13:22:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:03,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:03,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:03,724 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:22:03,725 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:22:03,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:22:03,748 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-16 13:22:03,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,757 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-16 13:22:03,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,757 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-16 13:22:03,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,758 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-16 13:22:03,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,758 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-16 13:22:03,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,759 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-16 13:22:03,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,762 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-16 13:22:03,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,763 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-16 13:22:03,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,764 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-16 13:22:03,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,764 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-16 13:22:03,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,765 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-16 13:22:03,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,766 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-16 13:22:03,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,767 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-16 13:22:03,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,768 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-16 13:22:03,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,770 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-16 13:22:03,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,770 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-16 13:22:03,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,771 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-16 13:22:03,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,772 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-16 13:22:03,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,772 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-16 13:22:03,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,779 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-16 13:22:03,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,780 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-16 13:22:03,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,780 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-16 13:22:03,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,781 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-16 13:22:03,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,781 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-16 13:22:03,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,782 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-16 13:22:03,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,782 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-16 13:22:03,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,783 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-16 13:22:03,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,784 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-16 13:22:03,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,785 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-16 13:22:03,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:03,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:03 BasicIcfg [2020-10-16 13:22:03,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:22:03,882 INFO L168 Benchmark]: Toolchain (without parser) took 11641.73 ms. Allocated memory was 142.1 MB in the beginning and 337.1 MB in the end (delta: 195.0 MB). Free memory was 104.1 MB in the beginning and 113.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 185.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:03,883 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 142.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:22:03,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.45 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 103.7 MB in the beginning and 159.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:03,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.15 ms. Allocated memory is still 205.0 MB. Free memory was 159.7 MB in the beginning and 156.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:03,886 INFO L168 Benchmark]: Boogie Preprocessor took 46.03 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:03,887 INFO L168 Benchmark]: RCFGBuilder took 1993.22 ms. Allocated memory was 205.0 MB in the beginning and 243.8 MB in the end (delta: 38.8 MB). Free memory was 154.5 MB in the beginning and 185.3 MB in the end (delta: -30.8 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:03,888 INFO L168 Benchmark]: TraceAbstraction took 8814.06 ms. Allocated memory was 243.8 MB in the beginning and 337.1 MB in the end (delta: 93.3 MB). Free memory was 185.3 MB in the beginning and 113.5 MB in the end (delta: 71.8 MB). Peak memory consumption was 165.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:03,892 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 142.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 713.45 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 103.7 MB in the beginning and 159.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.15 ms. Allocated memory is still 205.0 MB. Free memory was 159.7 MB in the beginning and 156.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.03 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1993.22 ms. Allocated memory was 205.0 MB in the beginning and 243.8 MB in the end (delta: 38.8 MB). Free memory was 154.5 MB in the beginning and 185.3 MB in the end (delta: -30.8 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8814.06 ms. Allocated memory was 243.8 MB in the beginning and 337.1 MB in the end (delta: 93.3 MB). Free memory was 185.3 MB in the beginning and 113.5 MB in the end (delta: 71.8 MB). Peak memory consumption was 165.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 429 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 40 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.1s, 80 PlacesBefore, 28 PlacesAfterwards, 75 TransitionsBefore, 22 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 2462 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1451; [L782] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L783] 0 pthread_t t1452; [L784] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1] [L759] 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) [L759] 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) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 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 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 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 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L731] 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) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] 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) [L731] 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) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 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 [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 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 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L790] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] 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) [L801] 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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] EXPR 0 !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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 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)) [L806] EXPR 0 !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) [L806] 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)) [L806] 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)) [L807] 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)) [L807] EXPR 0 !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) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] EXPR 0 !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) [L807] 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)) [L807] 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)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 164 SDtfs, 214 SDslu, 330 SDs, 0 SdLazy, 267 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 9556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...