./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d4d730608c1bc8933272f53a76574a08ed0f181 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 02:56:58,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 02:56:58,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 02:56:58,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 02:56:58,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 02:56:58,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 02:56:58,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 02:56:58,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 02:56:58,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 02:56:58,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 02:56:58,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 02:56:58,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 02:56:58,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 02:56:58,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 02:56:58,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 02:56:58,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 02:56:58,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 02:56:58,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 02:56:58,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 02:56:58,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 02:56:58,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 02:56:58,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 02:56:58,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 02:56:58,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 02:56:58,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 02:56:58,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 02:56:58,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 02:56:58,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 02:56:58,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 02:56:58,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 02:56:58,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 02:56:58,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 02:56:58,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 02:56:58,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 02:56:58,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 02:56:58,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 02:56:58,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 02:56:58,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 02:56:58,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 02:56:58,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 02:56:58,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 02:56:58,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 02:56:58,950 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 02:56:58,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 02:56:58,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 02:56:58,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 02:56:58,952 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 02:56:58,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 02:56:58,952 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 02:56:58,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 02:56:58,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 02:56:58,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 02:56:58,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 02:56:58,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 02:56:58,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 02:56:58,954 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 02:56:58,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 02:56:58,954 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 02:56:58,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 02:56:58,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 02:56:58,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 02:56:58,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 02:56:58,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 02:56:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:56:58,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 02:56:58,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 02:56:58,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 02:56:58,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 02:56:58,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 02:56:58,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 02:56:58,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 02:56:58,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d4d730608c1bc8933272f53a76574a08ed0f181 [2020-10-20 02:56:59,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 02:56:59,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 02:56:59,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 02:56:59,161 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 02:56:59,161 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 02:56:59,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i [2020-10-20 02:56:59,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3bd0e5a/e7052399006e4397a404a00c7a1e04fe/FLAG009ccb115 [2020-10-20 02:56:59,787 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 02:56:59,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i [2020-10-20 02:56:59,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3bd0e5a/e7052399006e4397a404a00c7a1e04fe/FLAG009ccb115 [2020-10-20 02:57:00,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3bd0e5a/e7052399006e4397a404a00c7a1e04fe [2020-10-20 02:57:00,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 02:57:00,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 02:57:00,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 02:57:00,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 02:57:00,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 02:57:00,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707cc0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00, skipping insertion in model container [2020-10-20 02:57:00,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 02:57:00,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 02:57:00,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:57:00,591 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 02:57:00,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:57:00,762 INFO L208 MainTranslator]: Completed translation [2020-10-20 02:57:00,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00 WrapperNode [2020-10-20 02:57:00,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 02:57:00,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 02:57:00,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 02:57:00,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 02:57:00,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 02:57:00,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 02:57:00,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 02:57:00,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 02:57:00,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (1/1) ... [2020-10-20 02:57:00,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 02:57:00,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 02:57:00,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 02:57:00,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 02:57:00,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (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-20 02:57:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 02:57:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 02:57:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 02:57:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 02:57:00,949 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 02:57:00,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 02:57:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 02:57:00,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 02:57:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 02:57:00,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 02:57:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-20 02:57:00,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-20 02:57:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 02:57:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 02:57:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 02:57:00,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 02:57:00,953 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 02:57:02,876 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 02:57:02,877 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 02:57:02,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:57:02 BoogieIcfgContainer [2020-10-20 02:57:02,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 02:57:02,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 02:57:02,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 02:57:02,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 02:57:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 02:57:00" (1/3) ... [2020-10-20 02:57:02,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc64a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:57:02, skipping insertion in model container [2020-10-20 02:57:02,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:00" (2/3) ... [2020-10-20 02:57:02,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc64a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:57:02, skipping insertion in model container [2020-10-20 02:57:02,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:57:02" (3/3) ... [2020-10-20 02:57:02,890 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_pso.opt.i [2020-10-20 02:57:02,903 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 02:57:02,903 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 02:57:02,912 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 02:57:02,913 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 02:57:02,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,967 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,977 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,979 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,986 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,988 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,988 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,994 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,995 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:02,999 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 02:57:03,015 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 02:57:03,038 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 02:57:03,038 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 02:57:03,039 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 02:57:03,039 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 02:57:03,039 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 02:57:03,039 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 02:57:03,039 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 02:57:03,040 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 02:57:03,058 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 02:57:03,061 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-20 02:57:03,065 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-20 02:57:03,069 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-10-20 02:57:03,154 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-10-20 02:57:03,155 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 02:57:03,161 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-10-20 02:57:03,167 INFO L117 LiptonReduction]: Number of co-enabled transitions 2712 [2020-10-20 02:57:03,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:03,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:03,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:03,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:03,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:03,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:03,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:03,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:03,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:03,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:03,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:03,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:03,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:03,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:03,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:03,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:04,122 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-20 02:57:04,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:04,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:04,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:04,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:04,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:04,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:04,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:04,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:04,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:04,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:04,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:04,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:04,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:04,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:04,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:04,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:04,653 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-20 02:57:05,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:05,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 02:57:05,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:57:05,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:05,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:05,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:05,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:57:05,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:05,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:05,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:05,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:57:05,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:05,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:57:05,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:05,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:05,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:05,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:05,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:05,404 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-20 02:57:05,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:57:05,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:05,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:05,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:05,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:05,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:05,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:05,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:05,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:05,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:05,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:05,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:05,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:05,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:05,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:05,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:05,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:05,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:57:06,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:57:06,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:06,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:06,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:06,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:06,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:57:06,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:06,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:06,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:06,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:06,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:06,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:06,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:06,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:06,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:06,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:06,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:06,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:06,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:06,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:06,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:57:06,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:06,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:57:06,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:57:06,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:57:06,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:06,733 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-20 02:57:07,242 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-20 02:57:07,358 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-20 02:57:07,847 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-20 02:57:08,054 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-20 02:57:08,070 INFO L132 LiptonReduction]: Checked pairs total: 6820 [2020-10-20 02:57:08,070 INFO L134 LiptonReduction]: Total number of compositions: 106 [2020-10-20 02:57:08,077 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-20 02:57:08,273 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2858 states. [2020-10-20 02:57:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states. [2020-10-20 02:57:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:57:08,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:08,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:08,287 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1009244146, now seen corresponding path program 1 times [2020-10-20 02:57:08,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:08,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079950922] [2020-10-20 02:57:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:08,771 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-20 02:57:08,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079950922] [2020-10-20 02:57:08,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:08,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:57:08,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478038254] [2020-10-20 02:57:08,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:57:08,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:08,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:57:08,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:57:08,801 INFO L87 Difference]: Start difference. First operand 2858 states. Second operand 3 states. [2020-10-20 02:57:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:08,956 INFO L93 Difference]: Finished difference Result 2474 states and 9536 transitions. [2020-10-20 02:57:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:57:08,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 02:57:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:08,999 INFO L225 Difference]: With dead ends: 2474 [2020-10-20 02:57:09,000 INFO L226 Difference]: Without dead ends: 2090 [2020-10-20 02:57:09,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:57:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-10-20 02:57:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-10-20 02:57:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-20 02:57:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2020-10-20 02:57:09,189 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2020-10-20 02:57:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:09,191 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2020-10-20 02:57:09,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:57:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2020-10-20 02:57:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 02:57:09,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:09,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:09,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 02:57:09,202 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1619577879, now seen corresponding path program 1 times [2020-10-20 02:57:09,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:09,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364240658] [2020-10-20 02:57:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:09,329 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-20 02:57:09,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364240658] [2020-10-20 02:57:09,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:09,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:57:09,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008093781] [2020-10-20 02:57:09,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:09,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:09,333 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 transitions. Second operand 4 states. [2020-10-20 02:57:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:09,659 INFO L93 Difference]: Finished difference Result 2378 states and 8760 transitions. [2020-10-20 02:57:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:09,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 02:57:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:09,680 INFO L225 Difference]: With dead ends: 2378 [2020-10-20 02:57:09,680 INFO L226 Difference]: Without dead ends: 1994 [2020-10-20 02:57:09,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-20 02:57:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2020-10-20 02:57:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2020-10-20 02:57:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2020-10-20 02:57:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7528 transitions. [2020-10-20 02:57:09,759 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7528 transitions. Word has length 12 [2020-10-20 02:57:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:09,759 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7528 transitions. [2020-10-20 02:57:09,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7528 transitions. [2020-10-20 02:57:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 02:57:09,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:09,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:09,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 02:57:09,762 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:09,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1332677619, now seen corresponding path program 1 times [2020-10-20 02:57:09,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:09,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007747201] [2020-10-20 02:57:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:09,837 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-20 02:57:09,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007747201] [2020-10-20 02:57:09,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:09,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:57:09,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855806798] [2020-10-20 02:57:09,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:09,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:09,840 INFO L87 Difference]: Start difference. First operand 1994 states and 7528 transitions. Second operand 4 states. [2020-10-20 02:57:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:09,884 INFO L93 Difference]: Finished difference Result 2210 states and 8104 transitions. [2020-10-20 02:57:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:09,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 02:57:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:09,901 INFO L225 Difference]: With dead ends: 2210 [2020-10-20 02:57:09,902 INFO L226 Difference]: Without dead ends: 1922 [2020-10-20 02:57:09,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-20 02:57:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2020-10-20 02:57:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2020-10-20 02:57:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2020-10-20 02:57:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 7204 transitions. [2020-10-20 02:57:10,017 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 7204 transitions. Word has length 13 [2020-10-20 02:57:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:10,018 INFO L481 AbstractCegarLoop]: Abstraction has 1922 states and 7204 transitions. [2020-10-20 02:57:10,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 7204 transitions. [2020-10-20 02:57:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 02:57:10,020 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:10,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:10,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 02:57:10,021 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1636680533, now seen corresponding path program 1 times [2020-10-20 02:57:10,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:10,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21471490] [2020-10-20 02:57:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:10,101 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-20 02:57:10,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21471490] [2020-10-20 02:57:10,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:10,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:57:10,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710522642] [2020-10-20 02:57:10,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:10,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:10,104 INFO L87 Difference]: Start difference. First operand 1922 states and 7204 transitions. Second operand 4 states. [2020-10-20 02:57:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:10,137 INFO L93 Difference]: Finished difference Result 2022 states and 7366 transitions. [2020-10-20 02:57:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:10,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 02:57:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:10,152 INFO L225 Difference]: With dead ends: 2022 [2020-10-20 02:57:10,153 INFO L226 Difference]: Without dead ends: 1722 [2020-10-20 02:57:10,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-20 02:57:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-10-20 02:57:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-10-20 02:57:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-20 02:57:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6380 transitions. [2020-10-20 02:57:10,217 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6380 transitions. Word has length 14 [2020-10-20 02:57:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:10,217 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6380 transitions. [2020-10-20 02:57:10,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6380 transitions. [2020-10-20 02:57:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 02:57:10,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:10,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:10,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 02:57:10,221 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1914366310, now seen corresponding path program 1 times [2020-10-20 02:57:10,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:10,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131812681] [2020-10-20 02:57:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:10,334 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-20 02:57:10,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131812681] [2020-10-20 02:57:10,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:10,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:10,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882402976] [2020-10-20 02:57:10,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:10,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:10,336 INFO L87 Difference]: Start difference. First operand 1722 states and 6380 transitions. Second operand 4 states. [2020-10-20 02:57:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:10,415 INFO L93 Difference]: Finished difference Result 1734 states and 5839 transitions. [2020-10-20 02:57:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:10,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 02:57:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:10,427 INFO L225 Difference]: With dead ends: 1734 [2020-10-20 02:57:10,427 INFO L226 Difference]: Without dead ends: 1350 [2020-10-20 02:57:10,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-10-20 02:57:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2020-10-20 02:57:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2020-10-20 02:57:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 4520 transitions. [2020-10-20 02:57:10,469 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 4520 transitions. Word has length 16 [2020-10-20 02:57:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:10,469 INFO L481 AbstractCegarLoop]: Abstraction has 1350 states and 4520 transitions. [2020-10-20 02:57:10,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 4520 transitions. [2020-10-20 02:57:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:57:10,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:10,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:10,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 02:57:10,473 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash 584552028, now seen corresponding path program 1 times [2020-10-20 02:57:10,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:10,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492102931] [2020-10-20 02:57:10,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:10,525 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-20 02:57:10,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492102931] [2020-10-20 02:57:10,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:10,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:10,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060070504] [2020-10-20 02:57:10,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:10,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:10,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:10,527 INFO L87 Difference]: Start difference. First operand 1350 states and 4520 transitions. Second operand 4 states. [2020-10-20 02:57:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:10,563 INFO L93 Difference]: Finished difference Result 2014 states and 6492 transitions. [2020-10-20 02:57:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:10,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 02:57:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:10,574 INFO L225 Difference]: With dead ends: 2014 [2020-10-20 02:57:10,575 INFO L226 Difference]: Without dead ends: 1424 [2020-10-20 02:57:10,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-10-20 02:57:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1304. [2020-10-20 02:57:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2020-10-20 02:57:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 4174 transitions. [2020-10-20 02:57:10,620 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 4174 transitions. Word has length 17 [2020-10-20 02:57:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:10,620 INFO L481 AbstractCegarLoop]: Abstraction has 1304 states and 4174 transitions. [2020-10-20 02:57:10,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 4174 transitions. [2020-10-20 02:57:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:57:10,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:10,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:10,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 02:57:10,624 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1637035712, now seen corresponding path program 1 times [2020-10-20 02:57:10,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:10,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147256391] [2020-10-20 02:57:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:10,679 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-20 02:57:10,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147256391] [2020-10-20 02:57:10,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:10,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:10,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360183628] [2020-10-20 02:57:10,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:10,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:10,682 INFO L87 Difference]: Start difference. First operand 1304 states and 4174 transitions. Second operand 4 states. [2020-10-20 02:57:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:10,746 INFO L93 Difference]: Finished difference Result 1928 states and 5922 transitions. [2020-10-20 02:57:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:10,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-20 02:57:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:10,757 INFO L225 Difference]: With dead ends: 1928 [2020-10-20 02:57:10,757 INFO L226 Difference]: Without dead ends: 1364 [2020-10-20 02:57:10,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-10-20 02:57:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1268. [2020-10-20 02:57:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2020-10-20 02:57:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 3860 transitions. [2020-10-20 02:57:10,797 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 3860 transitions. Word has length 18 [2020-10-20 02:57:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:10,798 INFO L481 AbstractCegarLoop]: Abstraction has 1268 states and 3860 transitions. [2020-10-20 02:57:10,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 3860 transitions. [2020-10-20 02:57:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:57:10,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:10,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:10,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 02:57:10,802 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1421483304, now seen corresponding path program 1 times [2020-10-20 02:57:10,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:10,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558530132] [2020-10-20 02:57:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:10,901 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-20 02:57:10,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558530132] [2020-10-20 02:57:10,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:10,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:57:10,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015838644] [2020-10-20 02:57:10,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:57:10,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:57:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:10,903 INFO L87 Difference]: Start difference. First operand 1268 states and 3860 transitions. Second operand 5 states. [2020-10-20 02:57:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:10,963 INFO L93 Difference]: Finished difference Result 1073 states and 2930 transitions. [2020-10-20 02:57:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:57:10,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-20 02:57:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:10,970 INFO L225 Difference]: With dead ends: 1073 [2020-10-20 02:57:10,970 INFO L226 Difference]: Without dead ends: 824 [2020-10-20 02:57:10,971 INFO L677 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-20 02:57:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-10-20 02:57:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2020-10-20 02:57:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-10-20 02:57:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2208 transitions. [2020-10-20 02:57:10,992 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2208 transitions. Word has length 18 [2020-10-20 02:57:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:10,993 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 2208 transitions. [2020-10-20 02:57:10,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:57:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2208 transitions. [2020-10-20 02:57:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:57:10,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:10,995 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:10,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 02:57:10,996 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1125617900, now seen corresponding path program 1 times [2020-10-20 02:57:10,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:10,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739546060] [2020-10-20 02:57:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:11,092 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-20 02:57:11,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739546060] [2020-10-20 02:57:11,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:11,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:57:11,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539030636] [2020-10-20 02:57:11,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:57:11,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:57:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:11,095 INFO L87 Difference]: Start difference. First operand 824 states and 2208 transitions. Second operand 6 states. [2020-10-20 02:57:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:11,188 INFO L93 Difference]: Finished difference Result 693 states and 1802 transitions. [2020-10-20 02:57:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:57:11,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 02:57:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:11,192 INFO L225 Difference]: With dead ends: 693 [2020-10-20 02:57:11,193 INFO L226 Difference]: Without dead ends: 558 [2020-10-20 02:57:11,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:57:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-20 02:57:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2020-10-20 02:57:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-20 02:57:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1432 transitions. [2020-10-20 02:57:11,207 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1432 transitions. Word has length 20 [2020-10-20 02:57:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:11,208 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1432 transitions. [2020-10-20 02:57:11,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:57:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1432 transitions. [2020-10-20 02:57:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 02:57:11,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:11,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:11,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 02:57:11,211 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash 83916614, now seen corresponding path program 1 times [2020-10-20 02:57:11,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:11,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010332802] [2020-10-20 02:57:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:11,316 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-20 02:57:11,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010332802] [2020-10-20 02:57:11,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:11,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:57:11,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965093160] [2020-10-20 02:57:11,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:57:11,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:57:11,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:57:11,319 INFO L87 Difference]: Start difference. First operand 558 states and 1432 transitions. Second operand 7 states. [2020-10-20 02:57:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:11,392 INFO L93 Difference]: Finished difference Result 525 states and 1366 transitions. [2020-10-20 02:57:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:57:11,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-20 02:57:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:11,395 INFO L225 Difference]: With dead ends: 525 [2020-10-20 02:57:11,395 INFO L226 Difference]: Without dead ends: 210 [2020-10-20 02:57:11,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:57:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-20 02:57:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-10-20 02:57:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-20 02:57:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2020-10-20 02:57:11,402 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 23 [2020-10-20 02:57:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:11,402 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2020-10-20 02:57:11,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:57:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2020-10-20 02:57:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:57:11,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:11,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:11,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 02:57:11,404 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -377745248, now seen corresponding path program 1 times [2020-10-20 02:57:11,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:11,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345294699] [2020-10-20 02:57:11,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:11,472 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-20 02:57:11,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345294699] [2020-10-20 02:57:11,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:11,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:57:11,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403368463] [2020-10-20 02:57:11,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:57:11,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:57:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:11,474 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand 5 states. [2020-10-20 02:57:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:11,503 INFO L93 Difference]: Finished difference Result 276 states and 656 transitions. [2020-10-20 02:57:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:11,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-20 02:57:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:11,505 INFO L225 Difference]: With dead ends: 276 [2020-10-20 02:57:11,505 INFO L226 Difference]: Without dead ends: 81 [2020-10-20 02:57:11,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:57:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-20 02:57:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-10-20 02:57:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-20 02:57:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 167 transitions. [2020-10-20 02:57:11,508 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 167 transitions. Word has length 26 [2020-10-20 02:57:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:11,508 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 167 transitions. [2020-10-20 02:57:11,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:57:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 167 transitions. [2020-10-20 02:57:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:57:11,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:11,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:11,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 02:57:11,510 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash 105159192, now seen corresponding path program 2 times [2020-10-20 02:57:11,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:11,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612690238] [2020-10-20 02:57:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:11,720 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-20 02:57:11,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612690238] [2020-10-20 02:57:11,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:11,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:57:11,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128789250] [2020-10-20 02:57:11,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:57:11,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:57:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:11,723 INFO L87 Difference]: Start difference. First operand 81 states and 167 transitions. Second operand 6 states. [2020-10-20 02:57:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:11,800 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2020-10-20 02:57:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:57:11,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-20 02:57:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:11,802 INFO L225 Difference]: With dead ends: 100 [2020-10-20 02:57:11,802 INFO L226 Difference]: Without dead ends: 53 [2020-10-20 02:57:11,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:57:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-20 02:57:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-20 02:57:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 02:57:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2020-10-20 02:57:11,805 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 26 [2020-10-20 02:57:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:11,805 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 91 transitions. [2020-10-20 02:57:11,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:57:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2020-10-20 02:57:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:57:11,806 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:11,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:11,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 02:57:11,807 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:11,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2098621976, now seen corresponding path program 3 times [2020-10-20 02:57:11,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:11,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727102124] [2020-10-20 02:57:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:57:11,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:57:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:57:11,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:57:11,924 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 02:57:11,924 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 02:57:11,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 02:57:11,952 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-20 02:57:11,952 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [809] [2020-10-20 02:57:11,954 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-20 02:57:11,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,955 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-20 02:57:11,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,955 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-20 02:57:11,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,956 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-20 02:57:11,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,956 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-20 02:57:11,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,957 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-20 02:57:11,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,957 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-20 02:57:11,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,957 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-20 02:57:11,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,958 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-20 02:57:11,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,958 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-20 02:57:11,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,959 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-20 02:57:11,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,959 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-20 02:57:11,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,960 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-20 02:57:11,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,960 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-20 02:57:11,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,961 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-20 02:57:11,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,961 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-20 02:57:11,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,962 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-20 02:57:11,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,962 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-20 02:57:11,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,963 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-20 02:57:11,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,964 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-20 02:57:11,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,964 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-20 02:57:11,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,965 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-20 02:57:11,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:11,965 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-20 02:57:11,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 02:57:12 BasicIcfg [2020-10-20 02:57:12,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 02:57:12,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 02:57:12,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 02:57:12,061 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 02:57:12,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:57:02" (3/4) ... [2020-10-20 02:57:12,064 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 02:57:12,078 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-20 02:57:12,079 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [809] [2020-10-20 02:57:12,079 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-20 02:57:12,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,080 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-20 02:57:12,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,080 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-20 02:57:12,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,081 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-20 02:57:12,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,081 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-20 02:57:12,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,081 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-20 02:57:12,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,082 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-20 02:57:12,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,082 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-20 02:57:12,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,083 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-20 02:57:12,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,083 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-20 02:57:12,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,083 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-20 02:57:12,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,084 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-20 02:57:12,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,084 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-20 02:57:12,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,085 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-20 02:57:12,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,085 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-20 02:57:12,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,085 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-20 02:57:12,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,086 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-20 02:57:12,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,086 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-20 02:57:12,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,087 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-20 02:57:12,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,087 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-20 02:57:12,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,087 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-20 02:57:12,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,087 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-20 02:57:12,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,088 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-20 02:57:12,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:12,218 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 02:57:12,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 02:57:12,221 INFO L168 Benchmark]: Toolchain (without parser) took 12164.17 ms. Allocated memory was 35.7 MB in the beginning and 169.3 MB in the end (delta: 133.7 MB). Free memory was 8.5 MB in the beginning and 116.0 MB in the end (delta: -107.6 MB). Peak memory consumption was 112.1 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,221 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 35.1 MB. Free memory was 14.4 MB in the beginning and 14.4 MB in the end (delta: 49.2 kB). Peak memory consumption was 49.2 kB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.59 ms. Allocated memory was 35.7 MB in the beginning and 48.2 MB in the end (delta: 12.6 MB). Free memory was 7.5 MB in the beginning and 18.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 9.3 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.25 ms. Allocated memory is still 48.2 MB. Free memory was 18.6 MB in the beginning and 16.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,222 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 48.2 MB. Free memory was 16.0 MB in the beginning and 13.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,223 INFO L168 Benchmark]: RCFGBuilder took 2006.81 ms. Allocated memory was 48.2 MB in the beginning and 65.5 MB in the end (delta: 17.3 MB). Free memory was 13.5 MB in the beginning and 32.9 MB in the end (delta: -19.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,223 INFO L168 Benchmark]: TraceAbstraction took 9179.00 ms. Allocated memory was 65.5 MB in the beginning and 159.9 MB in the end (delta: 94.4 MB). Free memory was 32.2 MB in the beginning and 45.5 MB in the end (delta: -13.3 MB). Peak memory consumption was 81.1 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,224 INFO L168 Benchmark]: Witness Printer took 157.86 ms. Allocated memory was 159.9 MB in the beginning and 169.3 MB in the end (delta: 9.4 MB). Free memory was 45.5 MB in the beginning and 116.0 MB in the end (delta: -70.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:12,228 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 35.1 MB. Free memory was 14.4 MB in the beginning and 14.4 MB in the end (delta: 49.2 kB). Peak memory consumption was 49.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 699.59 ms. Allocated memory was 35.7 MB in the beginning and 48.2 MB in the end (delta: 12.6 MB). Free memory was 7.5 MB in the beginning and 18.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 9.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 69.25 ms. Allocated memory is still 48.2 MB. Free memory was 18.6 MB in the beginning and 16.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 48.2 MB. Free memory was 16.0 MB in the beginning and 13.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2006.81 ms. Allocated memory was 48.2 MB in the beginning and 65.5 MB in the end (delta: 17.3 MB). Free memory was 13.5 MB in the beginning and 32.9 MB in the end (delta: -19.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 9179.00 ms. Allocated memory was 65.5 MB in the beginning and 159.9 MB in the end (delta: 94.4 MB). Free memory was 32.2 MB in the beginning and 45.5 MB in the end (delta: -13.3 MB). Peak memory consumption was 81.1 MB. Max. memory is 14.3 GB. * Witness Printer took 157.86 ms. Allocated memory was 159.9 MB in the beginning and 169.3 MB in the end (delta: 9.4 MB). Free memory was 45.5 MB in the beginning and 116.0 MB in the end (delta: -70.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1943 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 230 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 130 PlacesBefore, 45 PlacesAfterwards, 120 TransitionsBefore, 33 TransitionsAfterwards, 2712 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 6820 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1069; [L855] FCALL, FORK 0 pthread_create(&t1069, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 pthread_t t1070; [L857] FCALL, FORK 0 pthread_create(&t1070, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1071; [L859] FCALL, FORK 0 pthread_create(&t1071, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1072; [L861] FCALL, FORK 0 pthread_create(&t1072, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix040_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 445 SDtfs, 445 SDslu, 818 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2858occurred 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 216 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 13789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...