/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:35:59,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:35:59,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:35:59,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:35:59,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:35:59,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:35:59,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:35:59,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:35:59,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:35:59,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:35:59,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:35:59,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:35:59,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:35:59,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:35:59,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:35:59,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:35:59,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:35:59,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:35:59,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:35:59,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:35:59,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:35:59,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:35:59,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:35:59,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:35:59,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:35:59,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:35:59,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:35:59,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:35:59,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:35:59,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:35:59,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:35:59,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:35:59,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:35:59,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:35:59,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:35:59,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:35:59,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:35:59,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:35:59,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:35:59,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:35:59,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:35:59,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:35:59,713 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:35:59,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:35:59,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:35:59,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:35:59,715 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:35:59,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:35:59,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:35:59,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:35:59,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:35:59,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:35:59,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:35:59,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:35:59,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:35:59,718 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:35:59,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:35:59,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:35:59,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:35:59,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:35:59,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:35:59,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:35:59,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:35:59,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:35:59,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:35:59,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:35:59,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:35:59,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:35:59,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:35:59,721 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:35:59,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:36:00,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:36:00,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:36:00,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:36:00,038 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:36:00,039 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:36:00,039 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2020-10-05 23:36:00,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891c12071/72c0ecbc14714d6fb0edaf623e999975/FLAGea69e1201 [2020-10-05 23:36:00,657 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:36:00,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2020-10-05 23:36:00,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891c12071/72c0ecbc14714d6fb0edaf623e999975/FLAGea69e1201 [2020-10-05 23:36:00,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891c12071/72c0ecbc14714d6fb0edaf623e999975 [2020-10-05 23:36:00,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:36:00,955 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:36:00,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:36:00,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:36:00,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:36:00,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:36:00" (1/1) ... [2020-10-05 23:36:00,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600eb3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:00, skipping insertion in model container [2020-10-05 23:36:00,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:36:00" (1/1) ... [2020-10-05 23:36:00,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:36:01,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:36:01,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:36:01,609 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:36:01,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:36:01,768 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:36:01,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01 WrapperNode [2020-10-05 23:36:01,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:36:01,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:36:01,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:36:01,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:36:01,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:36:01,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:36:01,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:36:01,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:36:01,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... [2020-10-05 23:36:01,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:36:01,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:36:01,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:36:01,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:36:01,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:36:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:36:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:36:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:36:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:36:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:36:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:36:01,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:36:01,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:36:01,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:36:01,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:36:01,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:36:01,972 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:36:03,953 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:36:03,954 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:36:03,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:36:03 BoogieIcfgContainer [2020-10-05 23:36:03,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:36:03,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:36:03,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:36:03,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:36:03,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:36:00" (1/3) ... [2020-10-05 23:36:03,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe75ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:36:03, skipping insertion in model container [2020-10-05 23:36:03,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:36:01" (2/3) ... [2020-10-05 23:36:03,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe75ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:36:03, skipping insertion in model container [2020-10-05 23:36:03,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:36:03" (3/3) ... [2020-10-05 23:36:03,965 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2020-10-05 23:36:03,976 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:36:03,976 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:36:03,984 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:36:03,985 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:36:04,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,030 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,031 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,031 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:36:04,048 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:36:04,072 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:36:04,072 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:36:04,072 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:36:04,072 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:36:04,072 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:36:04,073 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:36:04,073 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:36:04,073 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:36:04,088 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 166 flow [2020-10-05 23:36:04,090 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-05 23:36:04,131 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-05 23:36:04,131 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:36:04,136 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-05 23:36:04,139 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-05 23:36:04,158 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-05 23:36:04,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:36:04,159 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-05 23:36:04,160 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1012 [2020-10-05 23:36:04,162 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:36:04,754 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:36:04,876 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:36:06,232 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-05 23:36:06,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-05 23:36:06,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:36:06,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:36:06,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:36:07,117 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-05 23:36:08,794 WARN L193 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2020-10-05 23:36:09,107 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-05 23:36:09,956 WARN L193 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-05 23:36:10,256 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-05 23:36:11,145 WARN L193 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-10-05 23:36:11,452 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-05 23:36:12,030 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:36:12,418 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:36:12,801 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-05 23:36:12,920 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-05 23:36:12,926 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2968 [2020-10-05 23:36:12,927 INFO L214 etLargeBlockEncoding]: Total number of compositions: 67 [2020-10-05 23:36:12,930 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 52 flow [2020-10-05 23:36:12,948 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states. [2020-10-05 23:36:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2020-10-05 23:36:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:36:12,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:12,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:36:12,959 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 872957254, now seen corresponding path program 1 times [2020-10-05 23:36:12,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:12,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91224283] [2020-10-05 23:36:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:13,181 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-05 23:36:13,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91224283] [2020-10-05 23:36:13,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:13,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:36:13,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178309304] [2020-10-05 23:36:13,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:36:13,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:36:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:36:13,207 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2020-10-05 23:36:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:13,307 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-05 23:36:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:36:13,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:36:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:13,330 INFO L225 Difference]: With dead ends: 187 [2020-10-05 23:36:13,330 INFO L226 Difference]: Without dead ends: 152 [2020-10-05 23:36:13,332 INFO L675 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-05 23:36:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-05 23:36:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-05 23:36:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-05 23:36:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions. [2020-10-05 23:36:13,392 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5 [2020-10-05 23:36:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:13,393 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 357 transitions. [2020-10-05 23:36:13,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:36:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions. [2020-10-05 23:36:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:36:13,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:13,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:13,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:36:13,394 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1393376099, now seen corresponding path program 1 times [2020-10-05 23:36:13,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:13,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021392957] [2020-10-05 23:36:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:13,506 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-05 23:36:13,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021392957] [2020-10-05 23:36:13,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:13,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:36:13,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187161870] [2020-10-05 23:36:13,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:36:13,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:36:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:36:13,510 INFO L87 Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 3 states. [2020-10-05 23:36:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:13,548 INFO L93 Difference]: Finished difference Result 147 states and 343 transitions. [2020-10-05 23:36:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:36:13,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:36:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:13,553 INFO L225 Difference]: With dead ends: 147 [2020-10-05 23:36:13,553 INFO L226 Difference]: Without dead ends: 147 [2020-10-05 23:36:13,553 INFO L675 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-05 23:36:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-05 23:36:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-05 23:36:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-05 23:36:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 343 transitions. [2020-10-05 23:36:13,568 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 343 transitions. Word has length 7 [2020-10-05 23:36:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:13,568 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 343 transitions. [2020-10-05 23:36:13,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:36:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 343 transitions. [2020-10-05 23:36:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:36:13,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:13,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:13,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:36:13,570 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 243471209, now seen corresponding path program 1 times [2020-10-05 23:36:13,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:13,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313602493] [2020-10-05 23:36:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:13,641 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-05 23:36:13,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313602493] [2020-10-05 23:36:13,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:13,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:36:13,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679561470] [2020-10-05 23:36:13,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:36:13,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:36:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:36:13,643 INFO L87 Difference]: Start difference. First operand 147 states and 343 transitions. Second operand 3 states. [2020-10-05 23:36:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:13,651 INFO L93 Difference]: Finished difference Result 132 states and 301 transitions. [2020-10-05 23:36:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:36:13,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-05 23:36:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:13,654 INFO L225 Difference]: With dead ends: 132 [2020-10-05 23:36:13,654 INFO L226 Difference]: Without dead ends: 132 [2020-10-05 23:36:13,655 INFO L675 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-05 23:36:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-05 23:36:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-05 23:36:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-05 23:36:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 301 transitions. [2020-10-05 23:36:13,664 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 301 transitions. Word has length 8 [2020-10-05 23:36:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:13,664 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 301 transitions. [2020-10-05 23:36:13,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:36:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 301 transitions. [2020-10-05 23:36:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:36:13,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:13,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:13,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:36:13,666 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash -950197978, now seen corresponding path program 1 times [2020-10-05 23:36:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:13,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723134740] [2020-10-05 23:36:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:13,912 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-05 23:36:13,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723134740] [2020-10-05 23:36:13,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:13,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:36:13,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150549644] [2020-10-05 23:36:13,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:36:13,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:36:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:36:13,915 INFO L87 Difference]: Start difference. First operand 132 states and 301 transitions. Second operand 6 states. [2020-10-05 23:36:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:14,077 INFO L93 Difference]: Finished difference Result 139 states and 319 transitions. [2020-10-05 23:36:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:36:14,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-05 23:36:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:14,082 INFO L225 Difference]: With dead ends: 139 [2020-10-05 23:36:14,082 INFO L226 Difference]: Without dead ends: 139 [2020-10-05 23:36:14,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:36:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-05 23:36:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2020-10-05 23:36:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-05 23:36:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 295 transitions. [2020-10-05 23:36:14,092 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 295 transitions. Word has length 11 [2020-10-05 23:36:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:14,093 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 295 transitions. [2020-10-05 23:36:14,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:36:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 295 transitions. [2020-10-05 23:36:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:36:14,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:14,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:14,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:36:14,095 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash 608632615, now seen corresponding path program 1 times [2020-10-05 23:36:14,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:14,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508396748] [2020-10-05 23:36:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:14,235 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-05 23:36:14,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508396748] [2020-10-05 23:36:14,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:14,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:36:14,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27019542] [2020-10-05 23:36:14,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:36:14,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:36:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:36:14,239 INFO L87 Difference]: Start difference. First operand 130 states and 295 transitions. Second operand 6 states. [2020-10-05 23:36:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:14,447 INFO L93 Difference]: Finished difference Result 230 states and 512 transitions. [2020-10-05 23:36:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:36:14,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-05 23:36:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:14,450 INFO L225 Difference]: With dead ends: 230 [2020-10-05 23:36:14,450 INFO L226 Difference]: Without dead ends: 106 [2020-10-05 23:36:14,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-05 23:36:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-05 23:36:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2020-10-05 23:36:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 23:36:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 210 transitions. [2020-10-05 23:36:14,457 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 210 transitions. Word has length 12 [2020-10-05 23:36:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:14,457 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 210 transitions. [2020-10-05 23:36:14,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:36:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 210 transitions. [2020-10-05 23:36:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:36:14,459 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:14,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:14,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:36:14,459 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:14,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1687741796, now seen corresponding path program 1 times [2020-10-05 23:36:14,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:14,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000451776] [2020-10-05 23:36:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:14,582 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-05 23:36:14,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000451776] [2020-10-05 23:36:14,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:14,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:36:14,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994061036] [2020-10-05 23:36:14,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:36:14,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:14,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:36:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:36:14,584 INFO L87 Difference]: Start difference. First operand 96 states and 210 transitions. Second operand 4 states. [2020-10-05 23:36:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:14,613 INFO L93 Difference]: Finished difference Result 82 states and 151 transitions. [2020-10-05 23:36:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:36:14,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:36:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:14,615 INFO L225 Difference]: With dead ends: 82 [2020-10-05 23:36:14,615 INFO L226 Difference]: Without dead ends: 55 [2020-10-05 23:36:14,616 INFO L675 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-05 23:36:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-05 23:36:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-05 23:36:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-05 23:36:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2020-10-05 23:36:14,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 13 [2020-10-05 23:36:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:14,620 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2020-10-05 23:36:14,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:36:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2020-10-05 23:36:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:36:14,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:14,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:14,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:36:14,622 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1727981485, now seen corresponding path program 1 times [2020-10-05 23:36:14,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:14,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591688727] [2020-10-05 23:36:14,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:14,813 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-05 23:36:14,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591688727] [2020-10-05 23:36:14,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:14,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:36:14,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203046261] [2020-10-05 23:36:14,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:36:14,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:36:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:36:14,815 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 5 states. [2020-10-05 23:36:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:14,853 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2020-10-05 23:36:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:36:14,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:36:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:14,855 INFO L225 Difference]: With dead ends: 43 [2020-10-05 23:36:14,855 INFO L226 Difference]: Without dead ends: 34 [2020-10-05 23:36:14,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:36:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-05 23:36:14,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-05 23:36:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-05 23:36:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2020-10-05 23:36:14,858 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 14 [2020-10-05 23:36:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:14,859 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2020-10-05 23:36:14,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:36:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-10-05 23:36:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:36:14,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:14,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:14,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:36:14,860 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1918077124, now seen corresponding path program 1 times [2020-10-05 23:36:14,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:14,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814145414] [2020-10-05 23:36:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:36:15,297 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-05 23:36:15,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814145414] [2020-10-05 23:36:15,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:36:15,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:36:15,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304075734] [2020-10-05 23:36:15,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:36:15,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:36:15,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:36:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:36:15,305 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 8 states. [2020-10-05 23:36:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:36:15,433 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2020-10-05 23:36:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:36:15,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-05 23:36:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:36:15,435 INFO L225 Difference]: With dead ends: 49 [2020-10-05 23:36:15,435 INFO L226 Difference]: Without dead ends: 37 [2020-10-05 23:36:15,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:36:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-05 23:36:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-10-05 23:36:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-05 23:36:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-10-05 23:36:15,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 17 [2020-10-05 23:36:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:36:15,441 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-10-05 23:36:15,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:36:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-10-05 23:36:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:36:15,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:36:15,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:36:15,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:36:15,445 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:36:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:36:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 483918532, now seen corresponding path program 2 times [2020-10-05 23:36:15,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:36:15,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477350561] [2020-10-05 23:36:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:36:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:36:15,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:36:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:36:15,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:36:15,558 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:36:15,558 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:36:15,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:36:15,559 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:36:15,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L2-->L803: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-1299868247 256) 0)) (.cse7 (= 0 (mod ~x$r_buff0_thd0~0_In-1299868247 256))) (.cse9 (= (mod ~x$w_buff1_used~0_In-1299868247 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1299868247 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff1_used~0_Out-1299868247 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_In-1299868247 ~x$w_buff1_used~0_Out-1299868247))) (or (and .cse3 (= ~x$w_buff0_used~0_Out-1299868247 0) .cse4) (and .cse5 (= ~x$w_buff0_used~0_Out-1299868247 ~x$w_buff0_used~0_In-1299868247))) (= ~x$r_buff1_thd0~0_In-1299868247 ~x$r_buff1_thd0~0_Out-1299868247) (= ~x$r_buff0_thd0~0_In-1299868247 ~x$r_buff0_thd0~0_Out-1299868247) (or (and (or (and (= ~x~0_Out-1299868247 ~x$w_buff1~0_In-1299868247) .cse0 .cse1) (and .cse2 (= ~x~0_In-1299868247 ~x~0_Out-1299868247))) .cse5) (and (= ~x$w_buff0~0_In-1299868247 ~x~0_Out-1299868247) .cse3 .cse4)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1299868247 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1299868247|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1299868247 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1299868247, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1299868247, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1299868247|, ~x$w_buff1~0=~x$w_buff1~0_In-1299868247, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1299868247, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1299868247, ~x~0=~x~0_In-1299868247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1299868247} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1299868247, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1299868247, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1299868247|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1299868247|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1299868247|, ~x$w_buff1~0=~x$w_buff1~0_In-1299868247, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1299868247, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1299868247|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1299868247, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1299868247|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1299868247|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1299868247, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1299868247|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1299868247, ~x~0=~x~0_Out-1299868247} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 23:36:15,572 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-05 23:36:15,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,574 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-05 23:36:15,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,574 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-05 23:36:15,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,574 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-05 23:36:15,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,575 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-05 23:36:15,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,575 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-05 23:36:15,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,576 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-05 23:36:15,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,576 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-05 23:36:15,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,577 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-05 23:36:15,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,577 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-05 23:36:15,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,578 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-05 23:36:15,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,578 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-05 23:36:15,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,578 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-05 23:36:15,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,579 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-05 23:36:15,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,580 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-05 23:36:15,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,580 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-05 23:36:15,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,581 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-05 23:36:15,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,581 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-05 23:36:15,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,581 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-05 23:36:15,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,582 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-05 23:36:15,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,582 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-05 23:36:15,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,582 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-05 23:36:15,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,583 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-05 23:36:15,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,583 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-05 23:36:15,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,584 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-05 23:36:15,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,584 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-05 23:36:15,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:36:15,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:36:15 BasicIcfg [2020-10-05 23:36:15,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:36:15,661 INFO L168 Benchmark]: Toolchain (without parser) took 14703.52 ms. Allocated memory was 145.8 MB in the beginning and 334.5 MB in the end (delta: 188.7 MB). Free memory was 100.6 MB in the beginning and 231.0 MB in the end (delta: -130.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,662 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.13 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.2 MB in the beginning and 161.3 MB in the end (delta: -61.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.90 ms. Allocated memory is still 205.0 MB. Free memory was 161.3 MB in the beginning and 158.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,665 INFO L168 Benchmark]: Boogie Preprocessor took 63.52 ms. Allocated memory is still 205.0 MB. Free memory was 158.3 MB in the beginning and 155.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,667 INFO L168 Benchmark]: RCFGBuilder took 2053.93 ms. Allocated memory was 205.0 MB in the beginning and 248.0 MB in the end (delta: 43.0 MB). Free memory was 155.4 MB in the beginning and 202.2 MB in the end (delta: -46.9 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,668 INFO L168 Benchmark]: TraceAbstraction took 11698.36 ms. Allocated memory was 248.0 MB in the beginning and 334.5 MB in the end (delta: 86.5 MB). Free memory was 202.2 MB in the beginning and 231.0 MB in the end (delta: -28.7 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:36:15,678 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.13 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.2 MB in the beginning and 161.3 MB in the end (delta: -61.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.90 ms. Allocated memory is still 205.0 MB. Free memory was 161.3 MB in the beginning and 158.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.52 ms. Allocated memory is still 205.0 MB. Free memory was 158.3 MB in the beginning and 155.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2053.93 ms. Allocated memory was 205.0 MB in the beginning and 248.0 MB in the end (delta: 43.0 MB). Free memory was 155.4 MB in the beginning and 202.2 MB in the end (delta: -46.9 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11698.36 ms. Allocated memory was 248.0 MB in the beginning and 334.5 MB in the end (delta: 86.5 MB). Free memory was 202.2 MB in the beginning and 231.0 MB in the end (delta: -28.7 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.8s, 83 ProgramPointsBefore, 28 ProgramPointsAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 511 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2968 CheckedPairsTotal, 67 TotalNumberOfCompositions - 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; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L706] 0 _Bool x$flush_delayed; [L707] 0 int x$mem_tmp; [L708] 0 _Bool x$r_buff0_thd0; [L709] 0 _Bool x$r_buff0_thd1; [L710] 0 _Bool x$r_buff0_thd2; [L711] 0 _Bool x$r_buff1_thd0; [L712] 0 _Bool x$r_buff1_thd1; [L713] 0 _Bool x$r_buff1_thd2; [L714] 0 _Bool x$read_delayed; [L715] 0 int *x$read_delayed_var; [L716] 0 int x$w_buff0; [L717] 0 _Bool x$w_buff0_used; [L718] 0 int x$w_buff1; [L719] 0 _Bool x$w_buff1_used; [L721] 0 int y = 0; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L789] 0 pthread_t t1591; [L790] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L791] 0 pthread_t t1592; [L792] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L747] 2 x$w_buff1 = x$w_buff0 [L748] 2 x$w_buff0 = 2 [L749] 2 x$w_buff1_used = x$w_buff0_used [L750] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L758] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L764] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L727] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 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) [L733] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L733] 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) [L733] 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) [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 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 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L737] 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 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L767] 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) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] 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) [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 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 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L805] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 0 x$flush_delayed = weak$$choice2 [L808] 0 x$mem_tmp = x [L809] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L809] 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) [L809] 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) [L810] 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)) [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L810] 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)) [L810] 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)) [L811] 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)) [L811] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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) [L815] 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)) [L815] 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)) [L816] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L817] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L817] 0 x = x$flush_delayed ? x$mem_tmp : x [L818] 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=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 144 SDtfs, 125 SDslu, 209 SDs, 0 SdLazy, 191 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred 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, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 9866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...