./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.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/safe007_rmo.oepc.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 97c0c95a6c8d5d032b3cbd1021e0285dce8ef9a0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:03:43,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:03:43,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:03:43,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:03:43,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:03:43,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:03:43,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:03:43,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:03:43,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:03:43,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:03:43,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:03:43,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:03:43,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:03:43,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:03:43,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:03:43,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:03:43,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:03:43,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:03:43,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:03:43,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:03:43,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:03:43,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:03:43,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:03:43,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:03:43,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:03:43,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:03:43,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:03:43,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:03:43,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:03:43,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:03:43,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:03:43,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:03:43,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:03:43,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:03:43,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:03:43,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:03:43,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:03:43,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:03:43,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:03:43,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:03:43,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:03:43,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:03:44,009 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:03:44,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:03:44,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:03:44,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:03:44,011 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:03:44,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:03:44,011 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:03:44,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:03:44,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:03:44,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:03:44,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:03:44,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:03:44,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:03:44,014 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:03:44,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:03:44,014 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:03:44,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:03:44,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:03:44,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:03:44,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:03:44,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:03:44,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:03:44,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:03:44,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:03:44,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:03:44,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:03:44,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:03:44,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:03:44,017 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:03:44,017 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 -> 97c0c95a6c8d5d032b3cbd1021e0285dce8ef9a0 [2020-10-20 03:03:44,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:03:44,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:03:44,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:03:44,254 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:03:44,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:03:44,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.i [2020-10-20 03:03:44,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f98d3d83/af8df1ab062c4ad0b31bd9caa2aebe56/FLAGa0e78e0b4 [2020-10-20 03:03:44,902 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:03:44,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.i [2020-10-20 03:03:44,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f98d3d83/af8df1ab062c4ad0b31bd9caa2aebe56/FLAGa0e78e0b4 [2020-10-20 03:03:45,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f98d3d83/af8df1ab062c4ad0b31bd9caa2aebe56 [2020-10-20 03:03:45,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:03:45,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:03:45,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:03:45,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:03:45,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:03:45,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:03:45" (1/1) ... [2020-10-20 03:03:45,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c6c78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:45, skipping insertion in model container [2020-10-20 03:03:45,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:03:45" (1/1) ... [2020-10-20 03:03:45,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:03:45,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:03:45,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:03:45,877 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:03:45,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:03:46,043 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:03:46,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46 WrapperNode [2020-10-20 03:03:46,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:03:46,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:03:46,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:03:46,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:03:46,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:03:46,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:03:46,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:03:46,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:03:46,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... [2020-10-20 03:03:46,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:03:46,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:03:46,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:03:46,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:03:46,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:03:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:03:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:03:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:03:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:03:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:03:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:03:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:03:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:03:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:03:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:03:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:03:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:03:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:03:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:03:46,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:03:46,251 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 03:03:48,161 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:03:48,161 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 03:03:48,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:48 BoogieIcfgContainer [2020-10-20 03:03:48,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:03:48,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:03:48,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:03:48,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:03:48,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:03:45" (1/3) ... [2020-10-20 03:03:48,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd85ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:03:48, skipping insertion in model container [2020-10-20 03:03:48,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:46" (2/3) ... [2020-10-20 03:03:48,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd85ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:03:48, skipping insertion in model container [2020-10-20 03:03:48,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:48" (3/3) ... [2020-10-20 03:03:48,173 INFO L111 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc.i [2020-10-20 03:03:48,185 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:03:48,185 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:03:48,193 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 03:03:48,194 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:03:48,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:48,261 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:03:48,275 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-20 03:03:48,297 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:03:48,297 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:03:48,298 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:03:48,298 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:03:48,298 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:03:48,298 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:03:48,298 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:03:48,298 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:03:48,313 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:03:48,316 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 251 flow [2020-10-20 03:03:48,319 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 251 flow [2020-10-20 03:03:48,321 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2020-10-20 03:03:48,396 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-10-20 03:03:48,396 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:03:48,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-20 03:03:48,405 INFO L117 LiptonReduction]: Number of co-enabled transitions 1562 [2020-10-20 03:03:48,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:48,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:48,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:48,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:48,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:48,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:48,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:48,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:48,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:48,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:48,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:48,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:48,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:03:48,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:48,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:03:48,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:48,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:03:48,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:48,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:03:48,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:48,963 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 03:03:48,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:48,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:03:48,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:49,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:03:49,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:03:49,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:03:49,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:49,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:49,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:50,961 WARN L193 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-20 03:03:50,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:50,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,701 WARN L193 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-20 03:03:51,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:51,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:51,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:51,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:51,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:51,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:51,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:51,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:51,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:51,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:51,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:51,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:51,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:51,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:51,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:52,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:52,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:52,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:52,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:03:52,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:52,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:52,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-20 03:03:52,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:52,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:03:52,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:52,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:03:52,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:52,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:03:52,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:52,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:03:52,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:52,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:03:52,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:52,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:03:52,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:52,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:52,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:52,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:52,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,297 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-20 03:03:53,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:53,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:53,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,425 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-20 03:03:53,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:53,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:54,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:54,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:54,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:54,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:54,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:54,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:03:54,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:54,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:54,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:54,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:54,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:54,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:03:54,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:55,449 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-20 03:03:55,635 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-20 03:03:56,507 WARN L193 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-10-20 03:03:56,880 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-10-20 03:03:56,886 INFO L132 LiptonReduction]: Checked pairs total: 4133 [2020-10-20 03:03:56,886 INFO L134 LiptonReduction]: Total number of compositions: 112 [2020-10-20 03:03:56,893 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2020-10-20 03:03:56,928 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 522 states. [2020-10-20 03:03:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states. [2020-10-20 03:03:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 03:03:56,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:56,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:56,939 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash 830378078, now seen corresponding path program 1 times [2020-10-20 03:03:56,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:56,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417214729] [2020-10-20 03:03:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:57,149 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 03:03:57,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417214729] [2020-10-20 03:03:57,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:57,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:57,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834053952] [2020-10-20 03:03:57,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 03:03:57,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 03:03:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 03:03:57,172 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 2 states. [2020-10-20 03:03:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:57,211 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-10-20 03:03:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 03:03:57,213 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-20 03:03:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:57,232 INFO L225 Difference]: With dead ends: 522 [2020-10-20 03:03:57,233 INFO L226 Difference]: Without dead ends: 442 [2020-10-20 03:03:57,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 03:03:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-20 03:03:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-20 03:03:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-20 03:03:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-10-20 03:03:57,339 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 8 [2020-10-20 03:03:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:57,342 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-10-20 03:03:57,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 03:03:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-10-20 03:03:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:03:57,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:57,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:57,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:03:57,349 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash -870922441, now seen corresponding path program 1 times [2020-10-20 03:03:57,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:57,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796241246] [2020-10-20 03:03:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:57,678 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 03:03:57,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796241246] [2020-10-20 03:03:57,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:57,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:57,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278857237] [2020-10-20 03:03:57,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:57,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:57,682 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 4 states. [2020-10-20 03:03:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:57,727 INFO L93 Difference]: Finished difference Result 490 states and 1424 transitions. [2020-10-20 03:03:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:57,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 03:03:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:57,732 INFO L225 Difference]: With dead ends: 490 [2020-10-20 03:03:57,733 INFO L226 Difference]: Without dead ends: 410 [2020-10-20 03:03:57,734 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 03:03:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-20 03:03:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-10-20 03:03:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-20 03:03:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1224 transitions. [2020-10-20 03:03:57,761 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1224 transitions. Word has length 10 [2020-10-20 03:03:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:57,762 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1224 transitions. [2020-10-20 03:03:57,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1224 transitions. [2020-10-20 03:03:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:03:57,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:57,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:57,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:03:57,765 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1292502143, now seen corresponding path program 1 times [2020-10-20 03:03:57,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:57,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118410053] [2020-10-20 03:03:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:57,895 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 03:03:57,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118410053] [2020-10-20 03:03:57,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:57,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:57,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940143179] [2020-10-20 03:03:57,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:57,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:57,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:57,898 INFO L87 Difference]: Start difference. First operand 410 states and 1224 transitions. Second operand 4 states. [2020-10-20 03:03:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:57,931 INFO L93 Difference]: Finished difference Result 442 states and 1272 transitions. [2020-10-20 03:03:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:57,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 03:03:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:57,935 INFO L225 Difference]: With dead ends: 442 [2020-10-20 03:03:57,936 INFO L226 Difference]: Without dead ends: 378 [2020-10-20 03:03:57,936 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 03:03:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-10-20 03:03:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2020-10-20 03:03:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-10-20 03:03:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1112 transitions. [2020-10-20 03:03:57,953 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1112 transitions. Word has length 11 [2020-10-20 03:03:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:57,953 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 1112 transitions. [2020-10-20 03:03:57,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1112 transitions. [2020-10-20 03:03:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:03:57,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:57,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:57,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:03:57,956 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:57,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1459024118, now seen corresponding path program 1 times [2020-10-20 03:03:57,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:57,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390235945] [2020-10-20 03:03:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:58,080 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 03:03:58,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390235945] [2020-10-20 03:03:58,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:58,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:58,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780616604] [2020-10-20 03:03:58,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:58,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:58,082 INFO L87 Difference]: Start difference. First operand 378 states and 1112 transitions. Second operand 5 states. [2020-10-20 03:03:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:58,160 INFO L93 Difference]: Finished difference Result 490 states and 1408 transitions. [2020-10-20 03:03:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:58,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 03:03:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:58,164 INFO L225 Difference]: With dead ends: 490 [2020-10-20 03:03:58,164 INFO L226 Difference]: Without dead ends: 250 [2020-10-20 03:03:58,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:03:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-20 03:03:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2020-10-20 03:03:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-20 03:03:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 672 transitions. [2020-10-20 03:03:58,174 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 672 transitions. Word has length 12 [2020-10-20 03:03:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:58,175 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 672 transitions. [2020-10-20 03:03:58,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 672 transitions. [2020-10-20 03:03:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:03:58,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:58,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:58,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:03:58,181 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:58,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:58,181 INFO L82 PathProgramCache]: Analyzing trace with hash -169753408, now seen corresponding path program 1 times [2020-10-20 03:03:58,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:58,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931270871] [2020-10-20 03:03:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:58,271 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 03:03:58,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931270871] [2020-10-20 03:03:58,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:58,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:58,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060615851] [2020-10-20 03:03:58,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:58,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:58,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:58,273 INFO L87 Difference]: Start difference. First operand 250 states and 672 transitions. Second operand 5 states. [2020-10-20 03:03:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:58,327 INFO L93 Difference]: Finished difference Result 328 states and 851 transitions. [2020-10-20 03:03:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:58,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 03:03:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:58,329 INFO L225 Difference]: With dead ends: 328 [2020-10-20 03:03:58,330 INFO L226 Difference]: Without dead ends: 140 [2020-10-20 03:03:58,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:03:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-20 03:03:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-10-20 03:03:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-20 03:03:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 332 transitions. [2020-10-20 03:03:58,336 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 332 transitions. Word has length 13 [2020-10-20 03:03:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:58,336 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 332 transitions. [2020-10-20 03:03:58,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 332 transitions. [2020-10-20 03:03:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:03:58,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:58,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:58,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:03:58,338 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1595482652, now seen corresponding path program 1 times [2020-10-20 03:03:58,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:58,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121830283] [2020-10-20 03:03:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:58,973 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 03:03:58,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121830283] [2020-10-20 03:03:58,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:58,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:03:58,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160580584] [2020-10-20 03:03:58,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:03:58,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:03:58,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:03:58,978 INFO L87 Difference]: Start difference. First operand 140 states and 332 transitions. Second operand 8 states. [2020-10-20 03:03:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:59,284 INFO L93 Difference]: Finished difference Result 148 states and 340 transitions. [2020-10-20 03:03:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:59,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-20 03:03:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:59,287 INFO L225 Difference]: With dead ends: 148 [2020-10-20 03:03:59,287 INFO L226 Difference]: Without dead ends: 132 [2020-10-20 03:03:59,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:03:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-20 03:03:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-20 03:03:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-20 03:03:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 308 transitions. [2020-10-20 03:03:59,292 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 308 transitions. Word has length 15 [2020-10-20 03:03:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:59,292 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 308 transitions. [2020-10-20 03:03:59,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:03:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 308 transitions. [2020-10-20 03:03:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:03:59,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:59,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:59,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:03:59,294 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1980841294, now seen corresponding path program 1 times [2020-10-20 03:03:59,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:59,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775901663] [2020-10-20 03:03:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:59,379 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 03:03:59,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775901663] [2020-10-20 03:03:59,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:59,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:59,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445693884] [2020-10-20 03:03:59,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:59,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:59,381 INFO L87 Difference]: Start difference. First operand 132 states and 308 transitions. Second operand 4 states. [2020-10-20 03:03:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:59,426 INFO L93 Difference]: Finished difference Result 138 states and 292 transitions. [2020-10-20 03:03:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:59,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 03:03:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:59,428 INFO L225 Difference]: With dead ends: 138 [2020-10-20 03:03:59,429 INFO L226 Difference]: Without dead ends: 112 [2020-10-20 03:03:59,429 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 03:03:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-20 03:03:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-20 03:03:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-20 03:03:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 240 transitions. [2020-10-20 03:03:59,434 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 240 transitions. Word has length 16 [2020-10-20 03:03:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:59,435 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 240 transitions. [2020-10-20 03:03:59,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 240 transitions. [2020-10-20 03:03:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:03:59,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:59,436 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 03:03:59,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:03:59,436 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1558543474, now seen corresponding path program 1 times [2020-10-20 03:03:59,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:59,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130310766] [2020-10-20 03:03:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:59,576 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 03:03:59,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130310766] [2020-10-20 03:03:59,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:59,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:03:59,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522715426] [2020-10-20 03:03:59,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:59,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:59,580 INFO L87 Difference]: Start difference. First operand 112 states and 240 transitions. Second operand 5 states. [2020-10-20 03:03:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:59,638 INFO L93 Difference]: Finished difference Result 98 states and 185 transitions. [2020-10-20 03:03:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:59,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-20 03:03:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:59,640 INFO L225 Difference]: With dead ends: 98 [2020-10-20 03:03:59,641 INFO L226 Difference]: Without dead ends: 80 [2020-10-20 03:03:59,641 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 03:03:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-20 03:03:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-20 03:03:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-20 03:03:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 148 transitions. [2020-10-20 03:03:59,646 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 148 transitions. Word has length 17 [2020-10-20 03:03:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:59,646 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 148 transitions. [2020-10-20 03:03:59,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 148 transitions. [2020-10-20 03:03:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 03:03:59,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:59,647 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 03:03:59,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:03:59,648 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 314352554, now seen corresponding path program 1 times [2020-10-20 03:03:59,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:59,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633287075] [2020-10-20 03:03:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:59,739 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 03:03:59,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633287075] [2020-10-20 03:03:59,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:59,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:03:59,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858082119] [2020-10-20 03:03:59,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:03:59,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:59,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:03:59,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:59,743 INFO L87 Difference]: Start difference. First operand 80 states and 148 transitions. Second operand 6 states. [2020-10-20 03:03:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:59,807 INFO L93 Difference]: Finished difference Result 67 states and 120 transitions. [2020-10-20 03:03:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:03:59,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 03:03:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:59,809 INFO L225 Difference]: With dead ends: 67 [2020-10-20 03:03:59,809 INFO L226 Difference]: Without dead ends: 60 [2020-10-20 03:03:59,810 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 03:03:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-20 03:03:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-20 03:03:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 03:03:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 108 transitions. [2020-10-20 03:03:59,812 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 108 transitions. Word has length 18 [2020-10-20 03:03:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:59,812 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 108 transitions. [2020-10-20 03:03:59,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:03:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 108 transitions. [2020-10-20 03:03:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:03:59,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:59,813 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 03:03:59,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:03:59,813 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1609507362, now seen corresponding path program 1 times [2020-10-20 03:03:59,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:59,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316248215] [2020-10-20 03:03:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:03:59,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:03:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:03:59,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:03:59,997 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:03:59,998 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:03:59,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:04:00,026 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 03:04:00,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,027 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 03:04:00,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,027 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 03:04:00,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,028 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 03:04:00,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,028 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 03:04:00,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,029 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 03:04:00,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,029 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 03:04:00,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,030 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 03:04:00,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,030 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 03:04:00,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,031 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 03:04:00,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,031 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 03:04:00,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,032 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 03:04:00,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,034 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 03:04:00,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,035 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 03:04:00,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,035 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 03:04:00,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,036 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 03:04:00,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,036 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 03:04:00,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,037 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 03:04:00,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,038 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 03:04:00,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,038 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 03:04:00,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,039 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 03:04:00,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,039 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 03:04:00,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,040 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 03:04:00,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,041 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 03:04:00,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,041 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 03:04:00,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:04:00 BasicIcfg [2020-10-20 03:04:00,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:04:00,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:04:00,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:04:00,137 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:04:00,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:48" (3/4) ... [2020-10-20 03:04:00,141 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:04:00,155 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 03:04:00,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,155 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 03:04:00,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,156 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 03:04:00,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,156 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 03:04:00,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,157 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 03:04:00,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,157 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 03:04:00,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,158 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 03:04:00,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,158 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 03:04:00,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,158 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 03:04:00,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,159 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 03:04:00,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,159 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 03:04:00,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,159 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 03:04:00,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,160 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 03:04:00,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,161 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 03:04:00,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,161 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 03:04:00,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,162 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 03:04:00,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,162 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 03:04:00,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,162 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 03:04:00,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,163 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 03:04:00,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,163 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 03:04:00,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,164 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 03:04:00,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,164 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 03:04:00,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,164 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 03:04:00,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,165 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 03:04:00,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,165 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 03:04:00,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:00,318 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:04:00,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:04:00,320 INFO L168 Benchmark]: Toolchain (without parser) took 15061.83 ms. Allocated memory was 34.6 MB in the beginning and 121.1 MB in the end (delta: 86.5 MB). Free memory was 9.9 MB in the beginning and 44.3 MB in the end (delta: -34.4 MB). Peak memory consumption was 52.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,320 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.6 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.60 ms. Allocated memory was 34.6 MB in the beginning and 44.0 MB in the end (delta: 9.4 MB). Free memory was 9.0 MB in the beginning and 12.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.50 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 12.7 MB in the beginning and 27.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 760.5 kB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,321 INFO L168 Benchmark]: Boogie Preprocessor took 41.43 ms. Allocated memory is still 45.6 MB. Free memory was 27.0 MB in the beginning and 24.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,321 INFO L168 Benchmark]: RCFGBuilder took 1997.89 ms. Allocated memory was 45.6 MB in the beginning and 62.9 MB in the end (delta: 17.3 MB). Free memory was 24.4 MB in the beginning and 31.1 MB in the end (delta: -6.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,322 INFO L168 Benchmark]: TraceAbstraction took 11971.74 ms. Allocated memory was 62.9 MB in the beginning and 121.1 MB in the end (delta: 58.2 MB). Free memory was 31.1 MB in the beginning and 70.3 MB in the end (delta: -39.1 MB). Peak memory consumption was 78.2 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,322 INFO L168 Benchmark]: Witness Printer took 181.24 ms. Allocated memory is still 121.1 MB. Free memory was 70.3 MB in the beginning and 44.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:00,325 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.86 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.6 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 781.60 ms. Allocated memory was 34.6 MB in the beginning and 44.0 MB in the end (delta: 9.4 MB). Free memory was 9.0 MB in the beginning and 12.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 77.50 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 12.7 MB in the beginning and 27.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 760.5 kB. Max. memory is 14.3 GB. * Boogie Preprocessor took 41.43 ms. Allocated memory is still 45.6 MB. Free memory was 27.0 MB in the beginning and 24.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1997.89 ms. Allocated memory was 45.6 MB in the beginning and 62.9 MB in the end (delta: 17.3 MB). Free memory was 24.4 MB in the beginning and 31.1 MB in the end (delta: -6.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 14.3 GB. * TraceAbstraction took 11971.74 ms. Allocated memory was 62.9 MB in the beginning and 121.1 MB in the end (delta: 58.2 MB). Free memory was 31.1 MB in the beginning and 70.3 MB in the end (delta: -39.1 MB). Peak memory consumption was 78.2 MB. Max. memory is 14.3 GB. * Witness Printer took 181.24 ms. Allocated memory is still 121.1 MB. Free memory was 70.3 MB in the beginning and 44.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1088 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 125 PlacesBefore, 34 PlacesAfterwards, 118 TransitionsBefore, 25 TransitionsAfterwards, 1562 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 4133 MoverChecksTotal - CounterExampleResult [Line: 18]: 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_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L773] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L773] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=0, y=0, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L781] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L793] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L811] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L847] 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) [L847] 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) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 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 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe007_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 213 SDtfs, 234 SDslu, 356 SDs, 0 SdLazy, 173 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 13049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...