./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d6f31d821aa025b28d4035b64808d1f0165aebf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f470102 [2019-12-07 21:04:45,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:04:45,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:04:45,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:04:45,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:04:45,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:04:45,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:04:45,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:04:45,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:04:45,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:04:45,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:04:45,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:04:45,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:04:45,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:04:45,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:04:45,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:04:45,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:04:45,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:04:45,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:04:45,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:04:45,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:04:45,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:04:45,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:04:45,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:04:45,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:04:45,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:04:45,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:04:45,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:04:45,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:04:45,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:04:45,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:04:45,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:04:45,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:04:45,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:04:45,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:04:45,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:04:45,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:04:45,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:04:45,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:04:45,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:04:45,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:04:45,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:04:45,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:04:45,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:04:45,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:04:45,784 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:04:45,784 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:04:45,784 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:04:45,785 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:04:45,785 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:04:45,786 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:04:45,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:04:45,786 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:04:45,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:04:45,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:04:45,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:04:45,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:04:45,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:04:45,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:04:45,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:04:45,789 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:04:45,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:04:45,789 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 4d6f31d821aa025b28d4035b64808d1f0165aebf [2019-12-07 21:04:45,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:04:45,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:04:45,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:04:45,899 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:04:45,900 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:04:45,900 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix009_pso.opt.i [2019-12-07 21:04:45,939 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/data/6011e5634/46613a13703840189b17c91587a49026/FLAG02a1e33c6 [2019-12-07 21:04:46,314 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:04:46,314 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/sv-benchmarks/c/pthread-wmm/mix009_pso.opt.i [2019-12-07 21:04:46,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/data/6011e5634/46613a13703840189b17c91587a49026/FLAG02a1e33c6 [2019-12-07 21:04:46,334 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/data/6011e5634/46613a13703840189b17c91587a49026 [2019-12-07 21:04:46,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:04:46,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:04:46,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:04:46,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:04:46,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:04:46,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46, skipping insertion in model container [2019-12-07 21:04:46,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:04:46,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:04:46,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:04:46,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:04:46,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:04:46,721 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:04:46,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46 WrapperNode [2019-12-07 21:04:46,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:04:46,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:04:46,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:04:46,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:04:46,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:04:46,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:04:46,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:04:46,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:04:46,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... [2019-12-07 21:04:46,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:04:46,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:04:46,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:04:46,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:04:46,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/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 [2019-12-07 21:04:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:04:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:04:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:04:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:04:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:04:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:04:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:04:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:04:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:04:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:04:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:04:46,845 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:04:47,232 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:04:47,232 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:04:47,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:47 BoogieIcfgContainer [2019-12-07 21:04:47,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:04:47,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:04:47,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:04:47,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:04:47,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:04:46" (1/3) ... [2019-12-07 21:04:47,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dce43fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:04:47, skipping insertion in model container [2019-12-07 21:04:47,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:46" (2/3) ... [2019-12-07 21:04:47,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dce43fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:04:47, skipping insertion in model container [2019-12-07 21:04:47,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:47" (3/3) ... [2019-12-07 21:04:47,237 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.opt.i [2019-12-07 21:04:47,243 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:04:47,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:04:47,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:04:47,249 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,275 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:04:47,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 21:04:47,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:04:47,323 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:04:47,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:04:47,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:04:47,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:04:47,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:04:47,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:04:47,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:04:47,334 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 229 transitions [2019-12-07 21:04:47,336 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 229 transitions [2019-12-07 21:04:47,393 INFO L134 PetriNetUnfolder]: 56/227 cut-off events. [2019-12-07 21:04:47,393 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:04:47,404 INFO L76 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 56/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 912 event pairs. 6/175 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 21:04:47,424 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 229 transitions [2019-12-07 21:04:47,457 INFO L134 PetriNetUnfolder]: 56/227 cut-off events. [2019-12-07 21:04:47,457 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:04:47,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 56/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 912 event pairs. 6/175 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 21:04:47,482 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 21:04:47,483 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:04:50,340 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 21:04:50,450 INFO L206 etLargeBlockEncoding]: Checked pairs total: 118733 [2019-12-07 21:04:50,451 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 21:04:50,453 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 123 transitions [2019-12-07 21:04:51,593 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22250 states. [2019-12-07 21:04:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22250 states. [2019-12-07 21:04:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:04:51,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:51,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:04:51,600 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 967970267, now seen corresponding path program 1 times [2019-12-07 21:04:51,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:51,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136508334] [2019-12-07 21:04:51,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:51,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136508334] [2019-12-07 21:04:51,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:51,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:04:51,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750278231] [2019-12-07 21:04:51,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:51,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:51,764 INFO L87 Difference]: Start difference. First operand 22250 states. Second operand 3 states. [2019-12-07 21:04:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:52,020 INFO L93 Difference]: Finished difference Result 22082 states and 78296 transitions. [2019-12-07 21:04:52,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:52,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:04:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:52,149 INFO L225 Difference]: With dead ends: 22082 [2019-12-07 21:04:52,149 INFO L226 Difference]: Without dead ends: 20570 [2019-12-07 21:04:52,150 INFO L630 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 [2019-12-07 21:04:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-12-07 21:04:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20570. [2019-12-07 21:04:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20570 states. [2019-12-07 21:04:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20570 states to 20570 states and 72872 transitions. [2019-12-07 21:04:52,905 INFO L78 Accepts]: Start accepts. Automaton has 20570 states and 72872 transitions. Word has length 5 [2019-12-07 21:04:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:52,906 INFO L462 AbstractCegarLoop]: Abstraction has 20570 states and 72872 transitions. [2019-12-07 21:04:52,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20570 states and 72872 transitions. [2019-12-07 21:04:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:04:52,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:52,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:52,909 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash 488138773, now seen corresponding path program 1 times [2019-12-07 21:04:52,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:52,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543939210] [2019-12-07 21:04:52,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:52,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543939210] [2019-12-07 21:04:52,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:52,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:52,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602728547] [2019-12-07 21:04:52,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:52,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:52,980 INFO L87 Difference]: Start difference. First operand 20570 states and 72872 transitions. Second operand 4 states. [2019-12-07 21:04:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:53,316 INFO L93 Difference]: Finished difference Result 32746 states and 111276 transitions. [2019-12-07 21:04:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:53,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:04:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:53,404 INFO L225 Difference]: With dead ends: 32746 [2019-12-07 21:04:53,404 INFO L226 Difference]: Without dead ends: 32730 [2019-12-07 21:04:53,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32730 states. [2019-12-07 21:04:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32730 to 31357. [2019-12-07 21:04:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31357 states. [2019-12-07 21:04:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31357 states to 31357 states and 107493 transitions. [2019-12-07 21:04:54,220 INFO L78 Accepts]: Start accepts. Automaton has 31357 states and 107493 transitions. Word has length 11 [2019-12-07 21:04:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:54,220 INFO L462 AbstractCegarLoop]: Abstraction has 31357 states and 107493 transitions. [2019-12-07 21:04:54,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31357 states and 107493 transitions. [2019-12-07 21:04:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:04:54,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:54,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:54,303 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:54,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -708377534, now seen corresponding path program 1 times [2019-12-07 21:04:54,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:54,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581404852] [2019-12-07 21:04:54,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:54,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581404852] [2019-12-07 21:04:54,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:54,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:54,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592110458] [2019-12-07 21:04:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:04:54,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:04:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:04:54,363 INFO L87 Difference]: Start difference. First operand 31357 states and 107493 transitions. Second operand 4 states. [2019-12-07 21:04:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:54,650 INFO L93 Difference]: Finished difference Result 41141 states and 138603 transitions. [2019-12-07 21:04:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:54,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 21:04:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:54,723 INFO L225 Difference]: With dead ends: 41141 [2019-12-07 21:04:54,724 INFO L226 Difference]: Without dead ends: 41125 [2019-12-07 21:04:54,724 INFO L630 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 [2019-12-07 21:04:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41125 states. [2019-12-07 21:04:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41125 to 36115. [2019-12-07 21:04:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36115 states. [2019-12-07 21:04:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36115 states to 36115 states and 123093 transitions. [2019-12-07 21:04:55,583 INFO L78 Accepts]: Start accepts. Automaton has 36115 states and 123093 transitions. Word has length 14 [2019-12-07 21:04:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:55,584 INFO L462 AbstractCegarLoop]: Abstraction has 36115 states and 123093 transitions. [2019-12-07 21:04:55,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:04:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36115 states and 123093 transitions. [2019-12-07 21:04:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:04:55,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:55,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:55,588 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash -484837769, now seen corresponding path program 1 times [2019-12-07 21:04:55,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:55,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945771193] [2019-12-07 21:04:55,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:55,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945771193] [2019-12-07 21:04:55,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:55,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:04:55,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360418648] [2019-12-07 21:04:55,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:55,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:55,620 INFO L87 Difference]: Start difference. First operand 36115 states and 123093 transitions. Second operand 3 states. [2019-12-07 21:04:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:55,837 INFO L93 Difference]: Finished difference Result 60120 states and 195578 transitions. [2019-12-07 21:04:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:55,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 21:04:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:55,943 INFO L225 Difference]: With dead ends: 60120 [2019-12-07 21:04:55,943 INFO L226 Difference]: Without dead ends: 60120 [2019-12-07 21:04:55,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60120 states. [2019-12-07 21:04:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60120 to 53845. [2019-12-07 21:04:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53845 states. [2019-12-07 21:04:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53845 states to 53845 states and 177890 transitions. [2019-12-07 21:04:57,169 INFO L78 Accepts]: Start accepts. Automaton has 53845 states and 177890 transitions. Word has length 15 [2019-12-07 21:04:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:57,169 INFO L462 AbstractCegarLoop]: Abstraction has 53845 states and 177890 transitions. [2019-12-07 21:04:57,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 53845 states and 177890 transitions. [2019-12-07 21:04:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:04:57,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:57,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:57,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:57,174 INFO L82 PathProgramCache]: Analyzing trace with hash -738389870, now seen corresponding path program 1 times [2019-12-07 21:04:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:57,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075343497] [2019-12-07 21:04:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:57,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075343497] [2019-12-07 21:04:57,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:57,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:04:57,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017764313] [2019-12-07 21:04:57,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:57,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:57,332 INFO L87 Difference]: Start difference. First operand 53845 states and 177890 transitions. Second operand 3 states. [2019-12-07 21:04:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:57,487 INFO L93 Difference]: Finished difference Result 53746 states and 177576 transitions. [2019-12-07 21:04:57,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:57,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 21:04:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:57,578 INFO L225 Difference]: With dead ends: 53746 [2019-12-07 21:04:57,578 INFO L226 Difference]: Without dead ends: 53746 [2019-12-07 21:04:57,579 INFO L630 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 [2019-12-07 21:04:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53746 states. [2019-12-07 21:04:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53746 to 53746. [2019-12-07 21:04:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53746 states. [2019-12-07 21:04:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53746 states to 53746 states and 177576 transitions. [2019-12-07 21:04:58,796 INFO L78 Accepts]: Start accepts. Automaton has 53746 states and 177576 transitions. Word has length 16 [2019-12-07 21:04:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:58,796 INFO L462 AbstractCegarLoop]: Abstraction has 53746 states and 177576 transitions. [2019-12-07 21:04:58,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:04:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 53746 states and 177576 transitions. [2019-12-07 21:04:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:04:58,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:58,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:58,801 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -740834796, now seen corresponding path program 1 times [2019-12-07 21:04:58,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:58,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580759399] [2019-12-07 21:04:58,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:58,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580759399] [2019-12-07 21:04:58,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:58,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:04:58,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165026995] [2019-12-07 21:04:58,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:04:58,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:04:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:58,836 INFO L87 Difference]: Start difference. First operand 53746 states and 177576 transitions. Second operand 3 states. [2019-12-07 21:04:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:58,999 INFO L93 Difference]: Finished difference Result 53746 states and 174997 transitions. [2019-12-07 21:04:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:04:59,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 21:04:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:59,088 INFO L225 Difference]: With dead ends: 53746 [2019-12-07 21:04:59,088 INFO L226 Difference]: Without dead ends: 53746 [2019-12-07 21:04:59,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:04:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53746 states. [2019-12-07 21:05:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53746 to 53126. [2019-12-07 21:05:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53126 states. [2019-12-07 21:05:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53126 states to 53126 states and 173193 transitions. [2019-12-07 21:05:00,275 INFO L78 Accepts]: Start accepts. Automaton has 53126 states and 173193 transitions. Word has length 17 [2019-12-07 21:05:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:00,275 INFO L462 AbstractCegarLoop]: Abstraction has 53126 states and 173193 transitions. [2019-12-07 21:05:00,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:05:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 53126 states and 173193 transitions. [2019-12-07 21:05:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:05:00,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:00,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:00,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:00,280 INFO L82 PathProgramCache]: Analyzing trace with hash -217577748, now seen corresponding path program 1 times [2019-12-07 21:05:00,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:00,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234380132] [2019-12-07 21:05:00,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:00,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234380132] [2019-12-07 21:05:00,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:00,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:05:00,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321980576] [2019-12-07 21:05:00,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:05:00,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:05:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:05:00,311 INFO L87 Difference]: Start difference. First operand 53126 states and 173193 transitions. Second operand 3 states. [2019-12-07 21:05:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:00,472 INFO L93 Difference]: Finished difference Result 50094 states and 162912 transitions. [2019-12-07 21:05:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:05:00,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 21:05:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:00,558 INFO L225 Difference]: With dead ends: 50094 [2019-12-07 21:05:00,558 INFO L226 Difference]: Without dead ends: 50094 [2019-12-07 21:05:00,558 INFO L630 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 [2019-12-07 21:05:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50094 states. [2019-12-07 21:05:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50094 to 50094. [2019-12-07 21:05:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50094 states. [2019-12-07 21:05:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50094 states to 50094 states and 162912 transitions. [2019-12-07 21:05:01,554 INFO L78 Accepts]: Start accepts. Automaton has 50094 states and 162912 transitions. Word has length 17 [2019-12-07 21:05:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:01,554 INFO L462 AbstractCegarLoop]: Abstraction has 50094 states and 162912 transitions. [2019-12-07 21:05:01,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:05:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 50094 states and 162912 transitions. [2019-12-07 21:05:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:05:01,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:01,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:01,558 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash -884985628, now seen corresponding path program 1 times [2019-12-07 21:05:01,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:01,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152130786] [2019-12-07 21:05:01,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:01,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152130786] [2019-12-07 21:05:01,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:01,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:05:01,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086674122] [2019-12-07 21:05:01,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:05:01,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:01,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:05:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:05:01,595 INFO L87 Difference]: Start difference. First operand 50094 states and 162912 transitions. Second operand 4 states. [2019-12-07 21:05:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:01,973 INFO L93 Difference]: Finished difference Result 62947 states and 202183 transitions. [2019-12-07 21:05:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:05:01,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 21:05:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:02,076 INFO L225 Difference]: With dead ends: 62947 [2019-12-07 21:05:02,076 INFO L226 Difference]: Without dead ends: 62929 [2019-12-07 21:05:02,076 INFO L630 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 [2019-12-07 21:05:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62929 states. [2019-12-07 21:05:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62929 to 50855. [2019-12-07 21:05:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50855 states. [2019-12-07 21:05:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50855 states to 50855 states and 165343 transitions. [2019-12-07 21:05:03,258 INFO L78 Accepts]: Start accepts. Automaton has 50855 states and 165343 transitions. Word has length 17 [2019-12-07 21:05:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:03,258 INFO L462 AbstractCegarLoop]: Abstraction has 50855 states and 165343 transitions. [2019-12-07 21:05:03,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:05:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 50855 states and 165343 transitions. [2019-12-07 21:05:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:05:03,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:03,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:03,267 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1886811320, now seen corresponding path program 1 times [2019-12-07 21:05:03,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:03,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56334244] [2019-12-07 21:05:03,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:03,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56334244] [2019-12-07 21:05:03,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:03,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:05:03,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719869015] [2019-12-07 21:05:03,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:05:03,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:05:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:05:03,299 INFO L87 Difference]: Start difference. First operand 50855 states and 165343 transitions. Second operand 3 states. [2019-12-07 21:05:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:03,314 INFO L93 Difference]: Finished difference Result 5110 states and 11896 transitions. [2019-12-07 21:05:03,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:05:03,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:05:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:03,318 INFO L225 Difference]: With dead ends: 5110 [2019-12-07 21:05:03,318 INFO L226 Difference]: Without dead ends: 5110 [2019-12-07 21:05:03,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:05:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2019-12-07 21:05:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 5110. [2019-12-07 21:05:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5110 states. [2019-12-07 21:05:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 11896 transitions. [2019-12-07 21:05:03,363 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 11896 transitions. Word has length 20 [2019-12-07 21:05:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:03,364 INFO L462 AbstractCegarLoop]: Abstraction has 5110 states and 11896 transitions. [2019-12-07 21:05:03,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:05:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 11896 transitions. [2019-12-07 21:05:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 21:05:03,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:03,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:03,366 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:03,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 54448529, now seen corresponding path program 1 times [2019-12-07 21:05:03,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:03,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614981218] [2019-12-07 21:05:03,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:03,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614981218] [2019-12-07 21:05:03,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:03,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:05:03,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587867242] [2019-12-07 21:05:03,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:05:03,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:05:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:05:03,413 INFO L87 Difference]: Start difference. First operand 5110 states and 11896 transitions. Second operand 5 states. [2019-12-07 21:05:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:03,654 INFO L93 Difference]: Finished difference Result 7094 states and 16087 transitions. [2019-12-07 21:05:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:05:03,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 21:05:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:03,659 INFO L225 Difference]: With dead ends: 7094 [2019-12-07 21:05:03,659 INFO L226 Difference]: Without dead ends: 7093 [2019-12-07 21:05:03,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:05:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7093 states. [2019-12-07 21:05:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7093 to 6440. [2019-12-07 21:05:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6440 states. [2019-12-07 21:05:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6440 states to 6440 states and 14783 transitions. [2019-12-07 21:05:03,720 INFO L78 Accepts]: Start accepts. Automaton has 6440 states and 14783 transitions. Word has length 28 [2019-12-07 21:05:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:03,720 INFO L462 AbstractCegarLoop]: Abstraction has 6440 states and 14783 transitions. [2019-12-07 21:05:03,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:05:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6440 states and 14783 transitions. [2019-12-07 21:05:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 21:05:03,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:03,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:03,724 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash 68434611, now seen corresponding path program 1 times [2019-12-07 21:05:03,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:03,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830626077] [2019-12-07 21:05:03,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:03,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830626077] [2019-12-07 21:05:03,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:03,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:05:03,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671280262] [2019-12-07 21:05:03,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:05:03,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:05:03,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:05:03,746 INFO L87 Difference]: Start difference. First operand 6440 states and 14783 transitions. Second operand 3 states. [2019-12-07 21:05:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:03,796 INFO L93 Difference]: Finished difference Result 6953 states and 14994 transitions. [2019-12-07 21:05:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:05:03,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 21:05:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:03,801 INFO L225 Difference]: With dead ends: 6953 [2019-12-07 21:05:03,801 INFO L226 Difference]: Without dead ends: 6953 [2019-12-07 21:05:03,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:05:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6953 states. [2019-12-07 21:05:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6953 to 6478. [2019-12-07 21:05:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2019-12-07 21:05:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 14049 transitions. [2019-12-07 21:05:03,862 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 14049 transitions. Word has length 31 [2019-12-07 21:05:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:03,862 INFO L462 AbstractCegarLoop]: Abstraction has 6478 states and 14049 transitions. [2019-12-07 21:05:03,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:05:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 14049 transitions. [2019-12-07 21:05:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:05:03,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:03,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:03,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1341933323, now seen corresponding path program 1 times [2019-12-07 21:05:03,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:03,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897550223] [2019-12-07 21:05:03,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:03,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897550223] [2019-12-07 21:05:03,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:03,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:05:03,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623343929] [2019-12-07 21:05:03,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:05:03,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:05:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:05:03,904 INFO L87 Difference]: Start difference. First operand 6478 states and 14049 transitions. Second operand 4 states. [2019-12-07 21:05:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:03,919 INFO L93 Difference]: Finished difference Result 4063 states and 8848 transitions. [2019-12-07 21:05:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:05:03,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 21:05:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:03,921 INFO L225 Difference]: With dead ends: 4063 [2019-12-07 21:05:03,921 INFO L226 Difference]: Without dead ends: 4063 [2019-12-07 21:05:03,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:05:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2019-12-07 21:05:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3519. [2019-12-07 21:05:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3519 states. [2019-12-07 21:05:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 7798 transitions. [2019-12-07 21:05:03,951 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 7798 transitions. Word has length 34 [2019-12-07 21:05:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:03,951 INFO L462 AbstractCegarLoop]: Abstraction has 3519 states and 7798 transitions. [2019-12-07 21:05:03,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:05:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 7798 transitions. [2019-12-07 21:05:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 21:05:03,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:03,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:03,955 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1469436246, now seen corresponding path program 1 times [2019-12-07 21:05:03,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:03,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695424853] [2019-12-07 21:05:03,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:03,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695424853] [2019-12-07 21:05:03,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:03,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:05:03,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143875238] [2019-12-07 21:05:04,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:05:04,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:04,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:05:04,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:05:04,000 INFO L87 Difference]: Start difference. First operand 3519 states and 7798 transitions. Second operand 4 states. [2019-12-07 21:05:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:04,022 INFO L93 Difference]: Finished difference Result 3981 states and 8766 transitions. [2019-12-07 21:05:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:05:04,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 21:05:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:04,023 INFO L225 Difference]: With dead ends: 3981 [2019-12-07 21:05:04,023 INFO L226 Difference]: Without dead ends: 517 [2019-12-07 21:05:04,024 INFO L630 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 [2019-12-07 21:05:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-12-07 21:05:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2019-12-07 21:05:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-12-07 21:05:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1041 transitions. [2019-12-07 21:05:04,030 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1041 transitions. Word has length 59 [2019-12-07 21:05:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:04,030 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 1041 transitions. [2019-12-07 21:05:04,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:05:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1041 transitions. [2019-12-07 21:05:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 21:05:04,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:04,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:04,032 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash 570658136, now seen corresponding path program 2 times [2019-12-07 21:05:04,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:04,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579445133] [2019-12-07 21:05:04,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:04,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579445133] [2019-12-07 21:05:04,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:04,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:05:04,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002358061] [2019-12-07 21:05:04,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:05:04,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:05:04,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:05:04,125 INFO L87 Difference]: Start difference. First operand 517 states and 1041 transitions. Second operand 8 states. [2019-12-07 21:05:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:04,300 INFO L93 Difference]: Finished difference Result 1065 states and 2145 transitions. [2019-12-07 21:05:04,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:05:04,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-07 21:05:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:04,301 INFO L225 Difference]: With dead ends: 1065 [2019-12-07 21:05:04,301 INFO L226 Difference]: Without dead ends: 750 [2019-12-07 21:05:04,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:05:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-12-07 21:05:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 586. [2019-12-07 21:05:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-12-07 21:05:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1160 transitions. [2019-12-07 21:05:04,306 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1160 transitions. Word has length 59 [2019-12-07 21:05:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:04,306 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 1160 transitions. [2019-12-07 21:05:04,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:05:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1160 transitions. [2019-12-07 21:05:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 21:05:04,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:04,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:04,308 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1265077194, now seen corresponding path program 3 times [2019-12-07 21:05:04,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:04,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894004979] [2019-12-07 21:05:04,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:04,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894004979] [2019-12-07 21:05:04,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:04,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:05:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569326129] [2019-12-07 21:05:04,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:05:04,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:05:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:05:04,386 INFO L87 Difference]: Start difference. First operand 586 states and 1160 transitions. Second operand 6 states. [2019-12-07 21:05:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:04,429 INFO L93 Difference]: Finished difference Result 1163 states and 2310 transitions. [2019-12-07 21:05:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:05:04,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 21:05:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:04,430 INFO L225 Difference]: With dead ends: 1163 [2019-12-07 21:05:04,430 INFO L226 Difference]: Without dead ends: 586 [2019-12-07 21:05:04,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:05:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-07 21:05:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-12-07 21:05:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-12-07 21:05:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1159 transitions. [2019-12-07 21:05:04,435 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1159 transitions. Word has length 59 [2019-12-07 21:05:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:04,435 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 1159 transitions. [2019-12-07 21:05:04,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:05:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1159 transitions. [2019-12-07 21:05:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 21:05:04,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:04,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:04,436 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:04,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1329242083, now seen corresponding path program 1 times [2019-12-07 21:05:04,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:04,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021473508] [2019-12-07 21:05:04,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:05:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:05:04,511 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:05:04,511 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:05:04,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~weak$$choice2~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_165 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t247~0.base_32|) 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_471 0) (= v_~y$r_buff1_thd1~0_243 0) (= 0 v_~y$r_buff0_thd2~0_451) (= v_~y$r_buff1_thd0~0_188 0) (= v_~z~0_63 0) (= v_~main$tmp_guard1~0_35 0) (= 0 |v_ULTIMATE.start_main_~#t247~0.offset_23|) (= v_~y$r_buff0_thd0~0_109 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t247~0.base_32| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t247~0.base_32|) (= 0 v_~y$r_buff1_thd2~0_323) (= 0 |v_#NULL.base_4|) (= v_~x~0_41 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_290 0) (= v_~y$w_buff1~0_183 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t247~0.base_32| 1)) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_43 0) (= 0 v_~y$w_buff0~0_198) (= 0 v_~__unbuffered_cnt~0_59) (= v_~y~0_230 0) (= v_~y$flush_delayed~0_205 0) (= 0 v_~weak$$choice0~0_154) (= v_~main$tmp_guard0~0_22 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t247~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t247~0.base_32|) |v_ULTIMATE.start_main_~#t247~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$w_buff0_used~0_808 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t248~0.offset=|v_ULTIMATE.start_main_~#t248~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t247~0.base=|v_ULTIMATE.start_main_~#t247~0.base_32|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_243, ULTIMATE.start_main_~#t247~0.offset=|v_ULTIMATE.start_main_~#t247~0.offset_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_198, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_205, #length=|v_#length_17|, ~y~0=v_~y~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_43, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_100|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_64|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_323, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_164|, ULTIMATE.start_main_~#t248~0.base=|v_ULTIMATE.start_main_~#t248~0.base_23|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, #valid=|v_#valid_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_451, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_237, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~x~0=v_~x~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t248~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t247~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t247~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t248~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:05:04,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t248~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t248~0.base_11|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t248~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t248~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t248~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t248~0.base_11|) |v_ULTIMATE.start_main_~#t248~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t248~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t248~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t248~0.base=|v_ULTIMATE.start_main_~#t248~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t248~0.offset=|v_ULTIMATE.start_main_~#t248~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t248~0.base, ULTIMATE.start_main_~#t248~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:05:04,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_50 v_~y$w_buff1~0_43) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~y$w_buff0_used~0_173 1) (= 1 v_~y$w_buff0~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_102 256))) (not (= 0 (mod v_~y$w_buff0_used~0_173 256))))) 1 0)) (= v_~y$w_buff0_used~0_174 v_~y$w_buff1_used~0_102)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_50, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_43, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_49, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:05:04,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L780-2-->L780-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1980133450| |P1Thread1of1ForFork1_#t~ite29_Out1980133450|)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1980133450 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1980133450 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite28_Out1980133450| ~y$w_buff0~0_In1980133450)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1980133450| ~y$w_buff1~0_In1980133450) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1980133450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1980133450, ~y$w_buff0~0=~y$w_buff0~0_In1980133450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1980133450} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1980133450|, ~y$w_buff1~0=~y$w_buff1~0_In1980133450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1980133450, ~y$w_buff0~0=~y$w_buff0~0_In1980133450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1980133450, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1980133450|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 21:05:04,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_57 256) 0)) (= v_~y$r_buff0_thd2~0_101 v_~y$r_buff0_thd2~0_100)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_57} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 21:05:04,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1451486272 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out1451486272| ~y~0_In1451486272)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out1451486272| ~y$mem_tmp~0_In1451486272)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1451486272, ~y$flush_delayed~0=~y$flush_delayed~0_In1451486272, ~y~0=~y~0_In1451486272} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1451486272, ~y$flush_delayed~0=~y$flush_delayed~0_In1451486272, ~y~0=~y~0_In1451486272, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1451486272|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 21:05:04,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1476036122 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1476036122 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1476036122 |P1Thread1of1ForFork1_#t~ite51_Out-1476036122|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1476036122|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1476036122, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1476036122} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1476036122, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1476036122|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1476036122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 21:05:04,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-584883083 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-584883083 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-584883083 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-584883083 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out-584883083| ~y$w_buff1_used~0_In-584883083)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-584883083|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-584883083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584883083, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-584883083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584883083} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-584883083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584883083, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-584883083|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-584883083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584883083} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 21:05:04,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In846417703 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In846417703 256))) (.cse2 (= ~y$r_buff0_thd2~0_In846417703 ~y$r_buff0_thd2~0_Out846417703))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out846417703) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In846417703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In846417703} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out846417703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In846417703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out846417703} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 21:05:04,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-706567409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-706567409 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-706567409 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-706567409 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-706567409 |P1Thread1of1ForFork1_#t~ite54_Out-706567409|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-706567409|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706567409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706567409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706567409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706567409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706567409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706567409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706567409, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-706567409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706567409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 21:05:04,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L799-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite54_26|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 21:05:04,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1435995393 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1435995393| ~y$mem_tmp~0_In1435995393) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out1435995393| ~y~0_In1435995393) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1435995393, ~y$flush_delayed~0=~y$flush_delayed~0_In1435995393, ~y~0=~y~0_In1435995393} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1435995393, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1435995393|, ~y$flush_delayed~0=~y$flush_delayed~0_In1435995393, ~y~0=~y~0_In1435995393} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 21:05:04,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L752-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y~0_147 |v_P0Thread1of1ForFork0_#t~ite25_28|) (= v_~y$flush_delayed~0_155 0) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_27|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~y~0=v_~y~0_147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 21:05:04,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:05:04,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1582160939 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-1582160939| |ULTIMATE.start_main_#t~ite57_Out-1582160939|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1582160939 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite57_Out-1582160939| ~y~0_In-1582160939)) (and (not .cse0) (= ~y$w_buff1~0_In-1582160939 |ULTIMATE.start_main_#t~ite57_Out-1582160939|) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1582160939, ~y~0=~y~0_In-1582160939, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582160939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582160939} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1582160939, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1582160939|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1582160939|, ~y~0=~y~0_In-1582160939, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582160939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582160939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 21:05:04,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-841088900 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-841088900 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-841088900|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-841088900 |ULTIMATE.start_main_#t~ite59_Out-841088900|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-841088900, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841088900} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-841088900, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841088900, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-841088900|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:05:04,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2040139633 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2040139633 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2040139633 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2040139633 256)))) (or (and (= ~y$w_buff1_used~0_In2040139633 |ULTIMATE.start_main_#t~ite60_Out2040139633|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite60_Out2040139633| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2040139633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040139633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2040139633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040139633} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2040139633|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2040139633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040139633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2040139633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040139633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 21:05:04,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2135593082 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2135593082 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-2135593082|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-2135593082 |ULTIMATE.start_main_#t~ite61_Out-2135593082|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2135593082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2135593082} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2135593082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2135593082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2135593082} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:05:04,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-39533926 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-39533926 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-39533926 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-39533926 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-39533926| 0)) (and (= ~y$r_buff1_thd0~0_In-39533926 |ULTIMATE.start_main_#t~ite62_Out-39533926|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-39533926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-39533926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-39533926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-39533926} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-39533926|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-39533926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-39533926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-39533926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-39533926} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:05:04,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_178 |v_ULTIMATE.start_main_#t~ite62_44|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_25 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_33 0) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_39 0) (= 1 v_~__unbuffered_p0_EAX~0_52))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_43|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_178, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:05:04,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:05:04 BasicIcfg [2019-12-07 21:05:04,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:05:04,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:05:04,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:05:04,584 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:05:04,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:47" (3/4) ... [2019-12-07 21:05:04,585 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:05:04,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~weak$$choice2~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_165 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t247~0.base_32|) 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_471 0) (= v_~y$r_buff1_thd1~0_243 0) (= 0 v_~y$r_buff0_thd2~0_451) (= v_~y$r_buff1_thd0~0_188 0) (= v_~z~0_63 0) (= v_~main$tmp_guard1~0_35 0) (= 0 |v_ULTIMATE.start_main_~#t247~0.offset_23|) (= v_~y$r_buff0_thd0~0_109 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t247~0.base_32| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t247~0.base_32|) (= 0 v_~y$r_buff1_thd2~0_323) (= 0 |v_#NULL.base_4|) (= v_~x~0_41 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_290 0) (= v_~y$w_buff1~0_183 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t247~0.base_32| 1)) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_43 0) (= 0 v_~y$w_buff0~0_198) (= 0 v_~__unbuffered_cnt~0_59) (= v_~y~0_230 0) (= v_~y$flush_delayed~0_205 0) (= 0 v_~weak$$choice0~0_154) (= v_~main$tmp_guard0~0_22 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t247~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t247~0.base_32|) |v_ULTIMATE.start_main_~#t247~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$w_buff0_used~0_808 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t248~0.offset=|v_ULTIMATE.start_main_~#t248~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t247~0.base=|v_ULTIMATE.start_main_~#t247~0.base_32|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_243, ULTIMATE.start_main_~#t247~0.offset=|v_ULTIMATE.start_main_~#t247~0.offset_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_198, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_205, #length=|v_#length_17|, ~y~0=v_~y~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_43, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_100|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_64|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_323, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_164|, ULTIMATE.start_main_~#t248~0.base=|v_ULTIMATE.start_main_~#t248~0.base_23|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, #valid=|v_#valid_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_451, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_237, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~x~0=v_~x~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t248~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t247~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t247~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t248~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:05:04,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t248~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t248~0.base_11|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t248~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t248~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t248~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t248~0.base_11|) |v_ULTIMATE.start_main_~#t248~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t248~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t248~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t248~0.base=|v_ULTIMATE.start_main_~#t248~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t248~0.offset=|v_ULTIMATE.start_main_~#t248~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t248~0.base, ULTIMATE.start_main_~#t248~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:05:04,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_50 v_~y$w_buff1~0_43) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~y$w_buff0_used~0_173 1) (= 1 v_~y$w_buff0~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_102 256))) (not (= 0 (mod v_~y$w_buff0_used~0_173 256))))) 1 0)) (= v_~y$w_buff0_used~0_174 v_~y$w_buff1_used~0_102)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_50, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_43, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_49, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:05:04,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L780-2-->L780-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1980133450| |P1Thread1of1ForFork1_#t~ite29_Out1980133450|)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1980133450 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1980133450 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite28_Out1980133450| ~y$w_buff0~0_In1980133450)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1980133450| ~y$w_buff1~0_In1980133450) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1980133450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1980133450, ~y$w_buff0~0=~y$w_buff0~0_In1980133450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1980133450} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1980133450|, ~y$w_buff1~0=~y$w_buff1~0_In1980133450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1980133450, ~y$w_buff0~0=~y$w_buff0~0_In1980133450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1980133450, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1980133450|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 21:05:04,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_57 256) 0)) (= v_~y$r_buff0_thd2~0_101 v_~y$r_buff0_thd2~0_100)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_57} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 21:05:04,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1451486272 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out1451486272| ~y~0_In1451486272)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out1451486272| ~y$mem_tmp~0_In1451486272)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1451486272, ~y$flush_delayed~0=~y$flush_delayed~0_In1451486272, ~y~0=~y~0_In1451486272} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1451486272, ~y$flush_delayed~0=~y$flush_delayed~0_In1451486272, ~y~0=~y~0_In1451486272, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1451486272|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 21:05:04,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1476036122 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1476036122 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1476036122 |P1Thread1of1ForFork1_#t~ite51_Out-1476036122|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1476036122|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1476036122, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1476036122} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1476036122, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1476036122|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1476036122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 21:05:04,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-584883083 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-584883083 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-584883083 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-584883083 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out-584883083| ~y$w_buff1_used~0_In-584883083)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-584883083|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-584883083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584883083, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-584883083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584883083} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-584883083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584883083, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-584883083|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-584883083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584883083} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 21:05:04,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In846417703 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In846417703 256))) (.cse2 (= ~y$r_buff0_thd2~0_In846417703 ~y$r_buff0_thd2~0_Out846417703))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out846417703) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In846417703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In846417703} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out846417703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In846417703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out846417703} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 21:05:04,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-706567409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-706567409 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-706567409 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-706567409 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-706567409 |P1Thread1of1ForFork1_#t~ite54_Out-706567409|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-706567409|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706567409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706567409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706567409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706567409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706567409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706567409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706567409, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-706567409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706567409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 21:05:04,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L799-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite54_26|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 21:05:04,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1435995393 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1435995393| ~y$mem_tmp~0_In1435995393) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out1435995393| ~y~0_In1435995393) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1435995393, ~y$flush_delayed~0=~y$flush_delayed~0_In1435995393, ~y~0=~y~0_In1435995393} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1435995393, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1435995393|, ~y$flush_delayed~0=~y$flush_delayed~0_In1435995393, ~y~0=~y~0_In1435995393} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 21:05:04,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L752-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y~0_147 |v_P0Thread1of1ForFork0_#t~ite25_28|) (= v_~y$flush_delayed~0_155 0) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_27|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~y~0=v_~y~0_147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 21:05:04,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:05:04,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1582160939 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-1582160939| |ULTIMATE.start_main_#t~ite57_Out-1582160939|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1582160939 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite57_Out-1582160939| ~y~0_In-1582160939)) (and (not .cse0) (= ~y$w_buff1~0_In-1582160939 |ULTIMATE.start_main_#t~ite57_Out-1582160939|) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1582160939, ~y~0=~y~0_In-1582160939, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582160939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582160939} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1582160939, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1582160939|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1582160939|, ~y~0=~y~0_In-1582160939, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582160939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582160939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 21:05:04,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-841088900 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-841088900 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-841088900|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-841088900 |ULTIMATE.start_main_#t~ite59_Out-841088900|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-841088900, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841088900} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-841088900, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841088900, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-841088900|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:05:04,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2040139633 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2040139633 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2040139633 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2040139633 256)))) (or (and (= ~y$w_buff1_used~0_In2040139633 |ULTIMATE.start_main_#t~ite60_Out2040139633|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite60_Out2040139633| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2040139633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040139633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2040139633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040139633} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2040139633|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2040139633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040139633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2040139633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040139633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 21:05:04,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2135593082 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2135593082 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-2135593082|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-2135593082 |ULTIMATE.start_main_#t~ite61_Out-2135593082|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2135593082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2135593082} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2135593082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2135593082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2135593082} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:05:04,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-39533926 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-39533926 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-39533926 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-39533926 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-39533926| 0)) (and (= ~y$r_buff1_thd0~0_In-39533926 |ULTIMATE.start_main_#t~ite62_Out-39533926|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-39533926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-39533926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-39533926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-39533926} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-39533926|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-39533926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-39533926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-39533926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-39533926} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:05:04,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_178 |v_ULTIMATE.start_main_#t~ite62_44|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_25 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_33 0) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_39 0) (= 1 v_~__unbuffered_p0_EAX~0_52))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_43|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_178, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:05:04,656 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7c570380-3155-462e-a3b4-8aa01c0f8589/bin/utaipan/witness.graphml [2019-12-07 21:05:04,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:05:04,657 INFO L168 Benchmark]: Toolchain (without parser) took 18320.45 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 940.8 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 756.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,658 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:04,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,658 INFO L168 Benchmark]: Boogie Preprocessor took 27.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,659 INFO L168 Benchmark]: RCFGBuilder took 439.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,659 INFO L168 Benchmark]: TraceAbstraction took 17349.94 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -953.2 MB). Peak memory consumption was 677.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,659 INFO L168 Benchmark]: Witness Printer took 72.97 ms. Allocated memory is still 2.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:04,660 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17349.94 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -953.2 MB). Peak memory consumption was 677.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.97 ms. Allocated memory is still 2.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 180 ProgramPointsBefore, 101 ProgramPointsAfterwards, 229 TransitionsBefore, 123 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 30 ChoiceCompositions, 9541 VarBasedMoverChecksPositive, 277 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 118733 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t247, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L820] FCALL, FORK 0 pthread_create(&t248, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L781] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 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) VAL [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L744] 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) [L745] 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 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)) [L746] 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 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)) [L747] 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 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)) [L748] 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 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)) [L749] 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 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)) [L750] 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 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)) [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2540 SDtfs, 2222 SDslu, 3503 SDs, 0 SdLazy, 1194 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53845occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 27188 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 68669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...