./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe014_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/safe014_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 0688dd211ee05a57c6a904acd89dccad3bc7bfd8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:04:51,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:04:51,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:04:51,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:04:51,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:04:51,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:04:51,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:04:51,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:04:51,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:04:51,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:04:51,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:04:51,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:04:51,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:04:51,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:04:51,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:04:51,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:04:51,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:04:51,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:04:51,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:04:51,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:04:51,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:04:51,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:04:51,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:04:51,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:04:51,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:04:51,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:04:51,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:04:51,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:04:51,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:04:51,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:04:51,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:04:51,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:04:51,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:04:51,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:04:51,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:04:51,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:04:51,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:04:51,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:04:51,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:04:51,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:04:51,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:04:51,669 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:04:51,691 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:04:51,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:04:51,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:04:51,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:04:51,693 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:04:51,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:04:51,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:04:51,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:04:51,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:04:51,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:04:51,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:04:51,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:04:51,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:04:51,695 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:04:51,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:04:51,695 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:04:51,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:04:51,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:04:51,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:04:51,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:04:51,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:04:51,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:04:51,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:04:51,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:04:51,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:04:51,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:04:51,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:04:51,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:04:51,698 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:04:51,698 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 -> 0688dd211ee05a57c6a904acd89dccad3bc7bfd8 [2020-10-20 03:04:51,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:04:51,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:04:51,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:04:51,914 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:04:51,914 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:04:51,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2020-10-20 03:04:51,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16fdd786/4287b74cdc1845219ba7168bdf91ce34/FLAG888bd982d [2020-10-20 03:04:52,632 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:04:52,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2020-10-20 03:04:52,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16fdd786/4287b74cdc1845219ba7168bdf91ce34/FLAG888bd982d [2020-10-20 03:04:52,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16fdd786/4287b74cdc1845219ba7168bdf91ce34 [2020-10-20 03:04:52,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:04:52,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:04:52,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:04:52,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:04:52,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:04:52,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:04:52" (1/1) ... [2020-10-20 03:04:52,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e87a5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:52, skipping insertion in model container [2020-10-20 03:04:52,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:04:52" (1/1) ... [2020-10-20 03:04:52,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:04:53,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:04:53,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:04:53,523 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:04:53,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:04:53,749 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:04:53,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53 WrapperNode [2020-10-20 03:04:53,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:04:53,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:04:53,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:04:53,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:04:53,758 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:04:53" (1/1) ... [2020-10-20 03:04:53,777 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:04:53" (1/1) ... [2020-10-20 03:04:53,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:04:53,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:04:53,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:04:53,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:04:53,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (1/1) ... [2020-10-20 03:04:53,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:04:53,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:04:53,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:04:53,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:04:53,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (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:04:53,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:04:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:04:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:04:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:04:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:04:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:04:53,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:04:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:04:53,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:04:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:04:53,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:04:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:04:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:04:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:04:53,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:04:53,919 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:04:55,957 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:04:55,957 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 03:04:55,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:04:55 BoogieIcfgContainer [2020-10-20 03:04:55,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:04:55,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:04:55,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:04:55,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:04:55,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:04:52" (1/3) ... [2020-10-20 03:04:55,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37db7a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:04:55, skipping insertion in model container [2020-10-20 03:04:55,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:53" (2/3) ... [2020-10-20 03:04:55,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37db7a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:04:55, skipping insertion in model container [2020-10-20 03:04:55,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:04:55" (3/3) ... [2020-10-20 03:04:55,976 INFO L111 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2020-10-20 03:04:55,988 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:04:55,989 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:04:55,998 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 03:04:55,999 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:04:56,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,068 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:56,098 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:04:56,113 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-20 03:04:56,163 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:04:56,164 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:04:56,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:04:56,164 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:04:56,164 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:04:56,164 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:04:56,164 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:04:56,164 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:04:56,180 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:04:56,183 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-20 03:04:56,186 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-20 03:04:56,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2020-10-20 03:04:56,245 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2020-10-20 03:04:56,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:04:56,250 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-20 03:04:56,254 INFO L117 LiptonReduction]: Number of co-enabled transitions 1562 [2020-10-20 03:04:56,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:04:56,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:56,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:04:56,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:56,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:04:56,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:56,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:04:56,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:56,890 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-20 03:04:56,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:04:56,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:56,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:04:56,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,022 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-20 03:04:57,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:04:57,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:57,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-10-20 03:04:57,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:57,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 3, 3, 2, 1] term [2020-10-20 03:04:57,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 2, 2, 2, 1] term [2020-10-20 03:04:57,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 03:04:57,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 03:04:57,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 03:04:57,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:04:57,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-20 03:04:57,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:57,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-20 03:04:57,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:58,662 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-10-20 03:04:58,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:04:58,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,361 WARN L193 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 110 [2020-10-20 03:04:59,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:04:59,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:04:59,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:04:59,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:04:59,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:04:59,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:04:59,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:04:59,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:59,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:04:59,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:05:00,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:00,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:00,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:00,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:05:00,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:00,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:00,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:05:00,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:00,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:05:00,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:00,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:00,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:00,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:00,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:05:01,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:01,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:01,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:01,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:05:01,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:01,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:01,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:05:01,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:01,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:05:01,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:01,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:01,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:01,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:01,999 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-20 03:05:02,173 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-20 03:05:02,342 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-20 03:05:03,163 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-10-20 03:05:03,327 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-20 03:05:03,516 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-10-20 03:05:03,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:05:03,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:03,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:05:03,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:03,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:05:03,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:03,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:05:03,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:04,418 WARN L193 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-10-20 03:05:04,754 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-20 03:05:04,821 INFO L132 LiptonReduction]: Checked pairs total: 4109 [2020-10-20 03:05:04,821 INFO L134 LiptonReduction]: Total number of compositions: 110 [2020-10-20 03:05:04,829 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 23 transitions, 61 flow [2020-10-20 03:05:04,877 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 442 states. [2020-10-20 03:05:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states. [2020-10-20 03:05:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:05:04,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:04,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:04,894 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:04,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:04,900 INFO L82 PathProgramCache]: Analyzing trace with hash -5966585, now seen corresponding path program 1 times [2020-10-20 03:05:04,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:04,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141293792] [2020-10-20 03:05:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:05,270 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:05:05,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141293792] [2020-10-20 03:05:05,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:05,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:05:05,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116551112] [2020-10-20 03:05:05,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:05:05,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:05:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:05,299 INFO L87 Difference]: Start difference. First operand 442 states. Second operand 3 states. [2020-10-20 03:05:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:05,349 INFO L93 Difference]: Finished difference Result 426 states and 1280 transitions. [2020-10-20 03:05:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:05,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 03:05:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:05,373 INFO L225 Difference]: With dead ends: 426 [2020-10-20 03:05:05,374 INFO L226 Difference]: Without dead ends: 346 [2020-10-20 03:05:05,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-10-20 03:05:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2020-10-20 03:05:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-10-20 03:05:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1016 transitions. [2020-10-20 03:05:05,474 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1016 transitions. Word has length 9 [2020-10-20 03:05:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:05,475 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 1016 transitions. [2020-10-20 03:05:05,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:05:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1016 transitions. [2020-10-20 03:05:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:05:05,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:05,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:05,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:05:05,479 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -186322765, now seen corresponding path program 1 times [2020-10-20 03:05:05,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:05,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550870776] [2020-10-20 03:05:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:05,584 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:05:05,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550870776] [2020-10-20 03:05:05,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:05,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:05:05,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205873604] [2020-10-20 03:05:05,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:05,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:05,588 INFO L87 Difference]: Start difference. First operand 346 states and 1016 transitions. Second operand 4 states. [2020-10-20 03:05:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:05,636 INFO L93 Difference]: Finished difference Result 474 states and 1368 transitions. [2020-10-20 03:05:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:05,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 03:05:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:05,643 INFO L225 Difference]: With dead ends: 474 [2020-10-20 03:05:05,644 INFO L226 Difference]: Without dead ends: 282 [2020-10-20 03:05:05,645 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:05:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-20 03:05:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-10-20 03:05:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-20 03:05:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 796 transitions. [2020-10-20 03:05:05,665 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 796 transitions. Word has length 10 [2020-10-20 03:05:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:05,665 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 796 transitions. [2020-10-20 03:05:05,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 796 transitions. [2020-10-20 03:05:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:05:05,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:05,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:05,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:05:05,668 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:05,669 INFO L82 PathProgramCache]: Analyzing trace with hash -285311166, now seen corresponding path program 1 times [2020-10-20 03:05:05,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:05,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259341331] [2020-10-20 03:05:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:05,754 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:05:05,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259341331] [2020-10-20 03:05:05,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:05,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:05,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982829309] [2020-10-20 03:05:05,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:05,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:05,756 INFO L87 Difference]: Start difference. First operand 282 states and 796 transitions. Second operand 4 states. [2020-10-20 03:05:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:05,791 INFO L93 Difference]: Finished difference Result 362 states and 996 transitions. [2020-10-20 03:05:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:05:05,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 03:05:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:05,794 INFO L225 Difference]: With dead ends: 362 [2020-10-20 03:05:05,795 INFO L226 Difference]: Without dead ends: 218 [2020-10-20 03:05:05,795 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:05:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-10-20 03:05:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2020-10-20 03:05:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-10-20 03:05:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 576 transitions. [2020-10-20 03:05:05,808 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 576 transitions. Word has length 11 [2020-10-20 03:05:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:05,809 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 576 transitions. [2020-10-20 03:05:05,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 576 transitions. [2020-10-20 03:05:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:05:05,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:05,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:05,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:05:05,811 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1892913434, now seen corresponding path program 1 times [2020-10-20 03:05:05,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:05,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705097873] [2020-10-20 03:05:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:05,885 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:05:05,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705097873] [2020-10-20 03:05:05,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:05,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:05:05,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427818486] [2020-10-20 03:05:05,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:05:05,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:05:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:05,888 INFO L87 Difference]: Start difference. First operand 218 states and 576 transitions. Second operand 3 states. [2020-10-20 03:05:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:05,898 INFO L93 Difference]: Finished difference Result 210 states and 550 transitions. [2020-10-20 03:05:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:05,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-20 03:05:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:05,902 INFO L225 Difference]: With dead ends: 210 [2020-10-20 03:05:05,902 INFO L226 Difference]: Without dead ends: 210 [2020-10-20 03:05:05,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-20 03:05:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-10-20 03:05:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-20 03:05:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 550 transitions. [2020-10-20 03:05:05,921 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 550 transitions. Word has length 12 [2020-10-20 03:05:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:05,922 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 550 transitions. [2020-10-20 03:05:05,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:05:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 550 transitions. [2020-10-20 03:05:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:05:05,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:05,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:05,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:05:05,930 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1450673693, now seen corresponding path program 1 times [2020-10-20 03:05:05,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:05,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523302648] [2020-10-20 03:05:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:06,307 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:05:06,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523302648] [2020-10-20 03:05:06,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:06,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:05:06,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033693749] [2020-10-20 03:05:06,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:05:06,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:06,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:05:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:06,309 INFO L87 Difference]: Start difference. First operand 210 states and 550 transitions. Second operand 6 states. [2020-10-20 03:05:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:06,448 INFO L93 Difference]: Finished difference Result 204 states and 531 transitions. [2020-10-20 03:05:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:06,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 03:05:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:06,451 INFO L225 Difference]: With dead ends: 204 [2020-10-20 03:05:06,451 INFO L226 Difference]: Without dead ends: 204 [2020-10-20 03:05:06,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:05:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-20 03:05:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-10-20 03:05:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-20 03:05:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 531 transitions. [2020-10-20 03:05:06,460 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 531 transitions. Word has length 13 [2020-10-20 03:05:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:06,461 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 531 transitions. [2020-10-20 03:05:06,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:05:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 531 transitions. [2020-10-20 03:05:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:05:06,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:06,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:06,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:05:06,463 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2064217971, now seen corresponding path program 1 times [2020-10-20 03:05:06,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:06,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626601172] [2020-10-20 03:05:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:06,563 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:05:06,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626601172] [2020-10-20 03:05:06,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:06,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:06,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394966174] [2020-10-20 03:05:06,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:06,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:06,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:06,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:06,566 INFO L87 Difference]: Start difference. First operand 204 states and 531 transitions. Second operand 4 states. [2020-10-20 03:05:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:06,607 INFO L93 Difference]: Finished difference Result 212 states and 497 transitions. [2020-10-20 03:05:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:05:06,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 03:05:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:06,610 INFO L225 Difference]: With dead ends: 212 [2020-10-20 03:05:06,610 INFO L226 Difference]: Without dead ends: 164 [2020-10-20 03:05:06,611 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:05:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-20 03:05:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2020-10-20 03:05:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-20 03:05:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 383 transitions. [2020-10-20 03:05:06,617 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 383 transitions. Word has length 14 [2020-10-20 03:05:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:06,618 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 383 transitions. [2020-10-20 03:05:06,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 383 transitions. [2020-10-20 03:05:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:05:06,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:06,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:06,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:05:06,621 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 446157151, now seen corresponding path program 1 times [2020-10-20 03:05:06,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:06,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026171764] [2020-10-20 03:05:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:05:06,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026171764] [2020-10-20 03:05:06,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:06,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:05:06,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261558986] [2020-10-20 03:05:06,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:05:06,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:05:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:05:06,773 INFO L87 Difference]: Start difference. First operand 164 states and 383 transitions. Second operand 5 states. [2020-10-20 03:05:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:06,833 INFO L93 Difference]: Finished difference Result 144 states and 306 transitions. [2020-10-20 03:05:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:05:06,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-20 03:05:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:06,835 INFO L225 Difference]: With dead ends: 144 [2020-10-20 03:05:06,836 INFO L226 Difference]: Without dead ends: 114 [2020-10-20 03:05:06,836 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:05:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-20 03:05:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-20 03:05:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-20 03:05:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 237 transitions. [2020-10-20 03:05:06,841 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 237 transitions. Word has length 15 [2020-10-20 03:05:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:06,842 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 237 transitions. [2020-10-20 03:05:06,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:05:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 237 transitions. [2020-10-20 03:05:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:05:06,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:06,843 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:05:06,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:05:06,844 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash -765055018, now seen corresponding path program 1 times [2020-10-20 03:05:06,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:06,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804769052] [2020-10-20 03:05:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:07,024 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:05:07,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804769052] [2020-10-20 03:05:07,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:07,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:05:07,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100778263] [2020-10-20 03:05:07,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:05:07,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:05:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:07,028 INFO L87 Difference]: Start difference. First operand 114 states and 237 transitions. Second operand 6 states. [2020-10-20 03:05:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:07,093 INFO L93 Difference]: Finished difference Result 102 states and 211 transitions. [2020-10-20 03:05:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:05:07,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-20 03:05:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:07,095 INFO L225 Difference]: With dead ends: 102 [2020-10-20 03:05:07,095 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 03:05:07,096 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:05:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 03:05:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-20 03:05:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 03:05:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2020-10-20 03:05:07,100 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 17 [2020-10-20 03:05:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:07,100 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2020-10-20 03:05:07,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:05:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2020-10-20 03:05:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 03:05:07,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:07,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:07,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:05:07,102 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash -876428581, now seen corresponding path program 1 times [2020-10-20 03:05:07,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:07,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926475122] [2020-10-20 03:05:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:07,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:05:07,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926475122] [2020-10-20 03:05:07,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:07,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:07,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97832924] [2020-10-20 03:05:07,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:07,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:07,152 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 4 states. [2020-10-20 03:05:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:07,176 INFO L93 Difference]: Finished difference Result 123 states and 249 transitions. [2020-10-20 03:05:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:07,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-20 03:05:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:07,178 INFO L225 Difference]: With dead ends: 123 [2020-10-20 03:05:07,178 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 03:05:07,178 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:05:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 03:05:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-20 03:05:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 03:05:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-20 03:05:07,181 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 19 [2020-10-20 03:05:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:07,182 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-20 03:05:07,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-20 03:05:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 03:05:07,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:07,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:07,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:05:07,184 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2100748115, now seen corresponding path program 2 times [2020-10-20 03:05:07,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:07,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066879119] [2020-10-20 03:05:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:07,232 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:05:07,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066879119] [2020-10-20 03:05:07,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:07,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:07,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104867587] [2020-10-20 03:05:07,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:07,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:07,234 INFO L87 Difference]: Start difference. First operand 65 states and 123 transitions. Second operand 4 states. [2020-10-20 03:05:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:07,256 INFO L93 Difference]: Finished difference Result 101 states and 190 transitions. [2020-10-20 03:05:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:05:07,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-20 03:05:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:07,257 INFO L225 Difference]: With dead ends: 101 [2020-10-20 03:05:07,258 INFO L226 Difference]: Without dead ends: 59 [2020-10-20 03:05:07,258 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:05:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-20 03:05:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-20 03:05:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 03:05:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 107 transitions. [2020-10-20 03:05:07,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 107 transitions. Word has length 19 [2020-10-20 03:05:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:07,261 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 107 transitions. [2020-10-20 03:05:07,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2020-10-20 03:05:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 03:05:07,262 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:07,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:07,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:05:07,263 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1419457171, now seen corresponding path program 3 times [2020-10-20 03:05:07,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:07,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133072096] [2020-10-20 03:05:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:05:07,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:05:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:05:07,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:05:07,391 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:05:07,392 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:05:07,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:05:07,393 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 03:05:07,409 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L4-->L850: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In1995328174 256) 0)) (.cse8 (= 0 (mod ~y$r_buff0_thd0~0_In1995328174 256))) (.cse10 (= (mod ~y$w_buff1_used~0_In1995328174 256) 0)) (.cse9 (= 0 (mod ~y$r_buff1_thd0~0_In1995328174 256)))) (let ((.cse2 (or .cse10 .cse9)) (.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse6 (or .cse7 .cse8)) (.cse3 (not .cse8)) (.cse5 (not .cse7))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out1995328174 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out1995328174 ~y$w_buff1_used~0_In1995328174))) (= ~y$r_buff0_thd0~0_In1995328174 ~y$r_buff0_thd0~0_Out1995328174) (let ((.cse4 (select |#memory_int_In1995328174| |~#y~0.base_In1995328174|))) (or (and .cse3 (= (store |#memory_int_In1995328174| |~#y~0.base_In1995328174| (store .cse4 |~#y~0.offset_In1995328174| ~y$w_buff0~0_In1995328174)) |#memory_int_Out1995328174|) .cse5) (and (or (and (= (store |#memory_int_In1995328174| |~#y~0.base_In1995328174| (store .cse4 |~#y~0.offset_In1995328174| (select .cse4 |~#y~0.offset_In1995328174|))) |#memory_int_Out1995328174|) .cse2) (and .cse0 .cse1 (= (store |#memory_int_In1995328174| |~#y~0.base_In1995328174| (store .cse4 |~#y~0.offset_In1995328174| ~y$w_buff1~0_In1995328174)) |#memory_int_Out1995328174|))) .cse6))) (= ~y$r_buff1_thd0~0_In1995328174 ~y$r_buff1_thd0~0_Out1995328174) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1995328174 0)) (or (and (= ~y$w_buff0_used~0_In1995328174 ~y$w_buff0_used~0_Out1995328174) .cse6) (and (= ~y$w_buff0_used~0_Out1995328174 0) .cse3 .cse5))))) InVars {~#y~0.offset=|~#y~0.offset_In1995328174|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1995328174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995328174, ~y$w_buff1~0=~y$w_buff1~0_In1995328174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1995328174, ~y$w_buff0~0=~y$w_buff0~0_In1995328174, #memory_int=|#memory_int_In1995328174|, ~#y~0.base=|~#y~0.base_In1995328174|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1995328174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995328174} OutVars{~#y~0.offset=|~#y~0.offset_In1995328174|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1995328174, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1995328174|, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1995328174|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1995328174|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1995328174|, ~#y~0.base=|~#y~0.base_In1995328174|, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1995328174|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1995328174|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1995328174|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1995328174, ~y$w_buff1~0=~y$w_buff1~0_In1995328174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1995328174, ~y$w_buff0~0=~y$w_buff0~0_In1995328174, #memory_int=|#memory_int_Out1995328174|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1995328174, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1995328174} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem42, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, #memory_int, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-20 03:05:07,430 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:05:07,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,430 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:05:07,431 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,431 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:05:07,431 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,431 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:05:07,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,432 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:05:07,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,432 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:05:07,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,433 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:05:07,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,433 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:05:07,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,434 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:05:07,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,434 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:05:07,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,434 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:05:07,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,435 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:05:07,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,439 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:05:07,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,439 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:05:07,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,439 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:05:07,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,440 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:05:07,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,440 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:05:07,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,440 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:05:07,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,441 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:05:07,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,442 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:05:07,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:05:07 BasicIcfg [2020-10-20 03:05:07,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:05:07,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:05:07,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:05:07,541 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:05:07,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:04:55" (3/4) ... [2020-10-20 03:05:07,545 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:05:07,556 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L4-->L850: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In1995328174 256) 0)) (.cse8 (= 0 (mod ~y$r_buff0_thd0~0_In1995328174 256))) (.cse10 (= (mod ~y$w_buff1_used~0_In1995328174 256) 0)) (.cse9 (= 0 (mod ~y$r_buff1_thd0~0_In1995328174 256)))) (let ((.cse2 (or .cse10 .cse9)) (.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse6 (or .cse7 .cse8)) (.cse3 (not .cse8)) (.cse5 (not .cse7))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out1995328174 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out1995328174 ~y$w_buff1_used~0_In1995328174))) (= ~y$r_buff0_thd0~0_In1995328174 ~y$r_buff0_thd0~0_Out1995328174) (let ((.cse4 (select |#memory_int_In1995328174| |~#y~0.base_In1995328174|))) (or (and .cse3 (= (store |#memory_int_In1995328174| |~#y~0.base_In1995328174| (store .cse4 |~#y~0.offset_In1995328174| ~y$w_buff0~0_In1995328174)) |#memory_int_Out1995328174|) .cse5) (and (or (and (= (store |#memory_int_In1995328174| |~#y~0.base_In1995328174| (store .cse4 |~#y~0.offset_In1995328174| (select .cse4 |~#y~0.offset_In1995328174|))) |#memory_int_Out1995328174|) .cse2) (and .cse0 .cse1 (= (store |#memory_int_In1995328174| |~#y~0.base_In1995328174| (store .cse4 |~#y~0.offset_In1995328174| ~y$w_buff1~0_In1995328174)) |#memory_int_Out1995328174|))) .cse6))) (= ~y$r_buff1_thd0~0_In1995328174 ~y$r_buff1_thd0~0_Out1995328174) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1995328174 0)) (or (and (= ~y$w_buff0_used~0_In1995328174 ~y$w_buff0_used~0_Out1995328174) .cse6) (and (= ~y$w_buff0_used~0_Out1995328174 0) .cse3 .cse5))))) InVars {~#y~0.offset=|~#y~0.offset_In1995328174|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1995328174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995328174, ~y$w_buff1~0=~y$w_buff1~0_In1995328174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1995328174, ~y$w_buff0~0=~y$w_buff0~0_In1995328174, #memory_int=|#memory_int_In1995328174|, ~#y~0.base=|~#y~0.base_In1995328174|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1995328174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995328174} OutVars{~#y~0.offset=|~#y~0.offset_In1995328174|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1995328174, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1995328174|, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1995328174|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1995328174|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1995328174|, ~#y~0.base=|~#y~0.base_In1995328174|, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1995328174|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1995328174|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1995328174|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1995328174, ~y$w_buff1~0=~y$w_buff1~0_In1995328174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1995328174, ~y$w_buff0~0=~y$w_buff0~0_In1995328174, #memory_int=|#memory_int_Out1995328174|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1995328174, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1995328174} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem42, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, #memory_int, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-20 03:05:07,558 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:05:07,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,559 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:05:07,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,559 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:05:07,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,559 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:05:07,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,560 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:05:07,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,560 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:05:07,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,560 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:05:07,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,561 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:05:07,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,561 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:05:07,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,561 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:05:07,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,562 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:05:07,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,562 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:05:07,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,563 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:05:07,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,563 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:05:07,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,564 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:05:07,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,564 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:05:07,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,564 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:05:07,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,565 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:05:07,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,565 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:05:07,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,566 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:05:07,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:07,665 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:05:07,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:05:07,667 INFO L168 Benchmark]: Toolchain (without parser) took 14690.15 ms. Allocated memory was 40.4 MB in the beginning and 118.5 MB in the end (delta: 78.1 MB). Free memory was 16.5 MB in the beginning and 59.7 MB in the end (delta: -43.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,667 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 30.9 MB. Free memory was 7.1 MB in the beginning and 7.1 MB in the end (delta: 42.1 kB). Peak memory consumption was 42.1 kB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.78 ms. Allocated memory was 40.4 MB in the beginning and 43.0 MB in the end (delta: 2.6 MB). Free memory was 15.5 MB in the beginning and 21.4 MB in the end (delta: -5.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 43.0 MB. Free memory was 21.4 MB in the beginning and 19.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,669 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 43.0 MB. Free memory was 19.0 MB in the beginning and 16.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,670 INFO L168 Benchmark]: RCFGBuilder took 2115.70 ms. Allocated memory was 43.0 MB in the beginning and 58.7 MB in the end (delta: 15.7 MB). Free memory was 16.5 MB in the beginning and 27.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,671 INFO L168 Benchmark]: TraceAbstraction took 11577.33 ms. Allocated memory was 58.7 MB in the beginning and 118.5 MB in the end (delta: 59.8 MB). Free memory was 27.1 MB in the beginning and 81.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 74.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,672 INFO L168 Benchmark]: Witness Printer took 124.20 ms. Allocated memory is still 118.5 MB. Free memory was 81.7 MB in the beginning and 59.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:07,677 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.23 ms. Allocated memory is still 30.9 MB. Free memory was 7.1 MB in the beginning and 7.1 MB in the end (delta: 42.1 kB). Peak memory consumption was 42.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 766.78 ms. Allocated memory was 40.4 MB in the beginning and 43.0 MB in the end (delta: 2.6 MB). Free memory was 15.5 MB in the beginning and 21.4 MB in the end (delta: -5.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 43.0 MB. Free memory was 21.4 MB in the beginning and 19.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 43.0 MB. Free memory was 19.0 MB in the beginning and 16.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2115.70 ms. Allocated memory was 43.0 MB in the beginning and 58.7 MB in the end (delta: 15.7 MB). Free memory was 16.5 MB in the beginning and 27.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 11577.33 ms. Allocated memory was 58.7 MB in the beginning and 118.5 MB in the end (delta: 59.8 MB). Free memory was 27.1 MB in the beginning and 81.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 74.1 MB. Max. memory is 14.3 GB. * Witness Printer took 124.20 ms. Allocated memory is still 118.5 MB. Free memory was 81.7 MB in the beginning and 59.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1121 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 108 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 124 PlacesBefore, 33 PlacesAfterwards, 117 TransitionsBefore, 23 TransitionsAfterwards, 1562 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 110 TotalNumberOfCompositions, 4109 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_p0_EBX = 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; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((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_p0_EBX=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={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 pthread_t t2110; [L837] FCALL, FORK 0 pthread_create(&t2110, ((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_p0_EBX=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={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 pthread_t t2111; [L839] FCALL, FORK 0 pthread_create(&t2111, ((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_p0_EBX=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={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$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={8: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_p0_EBX=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=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 __unbuffered_p0_EBX = x 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={8: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_p0_EBX=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=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 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={8: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_p0_EBX=0, __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=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 x = 2 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={8: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_p0_EBX=0, __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=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x 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={8: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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y = 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={8: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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe014_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={8: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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 222 SDtfs, 198 SDslu, 316 SDs, 0 SdLazy, 166 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 8155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...