./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.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_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/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 c117418973a225620f492f5db41566211ea7ca92 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:13:49,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:13:49,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:13:49,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:13:49,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:13:49,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:13:49,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:13:49,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:13:49,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:13:49,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:13:49,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:13:49,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:13:49,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:13:49,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:13:49,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:13:49,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:13:49,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:13:49,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:13:49,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:13:49,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:13:49,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:13:49,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:13:49,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:13:49,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:13:49,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:13:49,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:13:49,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:13:49,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:13:49,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:13:49,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:13:49,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:13:49,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:13:49,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:13:49,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:13:49,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:13:49,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:13:49,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:13:49,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:13:49,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:13:49,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:13:49,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:13:49,117 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:13:49,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:13:49,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:13:49,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:13:49,127 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:13:49,128 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:13:49,128 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:13:49,129 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:13:49,129 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:13:49,129 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:13:49,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:13:49,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:13:49,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:13:49,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:13:49,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:13:49,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:13:49,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:13:49,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:13:49,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:13:49,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:13:49,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:13:49,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:13:49,132 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_1cf08de0-d5a9-4f26-996b-25a82d737cf8/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 -> c117418973a225620f492f5db41566211ea7ca92 [2019-12-07 19:13:49,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:13:49,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:13:49,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:13:49,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:13:49,242 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:13:49,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt.i [2019-12-07 19:13:49,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/data/bb6d2862b/f8365fc3b4fe455399355ca7d7195e41/FLAGee4cae273 [2019-12-07 19:13:49,703 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:13:49,704 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/sv-benchmarks/c/pthread-wmm/mix033_rmo.opt.i [2019-12-07 19:13:49,714 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/data/bb6d2862b/f8365fc3b4fe455399355ca7d7195e41/FLAGee4cae273 [2019-12-07 19:13:50,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/data/bb6d2862b/f8365fc3b4fe455399355ca7d7195e41 [2019-12-07 19:13:50,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:13:50,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:13:50,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:13:50,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:13:50,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:13:50,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccbe965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50, skipping insertion in model container [2019-12-07 19:13:50,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:13:50,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:13:50,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:13:50,393 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:13:50,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:13:50,489 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:13:50,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50 WrapperNode [2019-12-07 19:13:50,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:13:50,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:13:50,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:13:50,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:13:50,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:13:50,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:13:50,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:13:50,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:13:50,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... [2019-12-07 19:13:50,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:13:50,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:13:50,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:13:50,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:13:50,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/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 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:13:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:13:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:13:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:13:50,594 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 19:13:50,929 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:13:50,929 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:13:50,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:13:50 BoogieIcfgContainer [2019-12-07 19:13:50,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:13:50,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:13:50,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:13:50,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:13:50,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:13:50" (1/3) ... [2019-12-07 19:13:50,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4693af5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:13:50, skipping insertion in model container [2019-12-07 19:13:50,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:13:50" (2/3) ... [2019-12-07 19:13:50,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4693af5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:13:50, skipping insertion in model container [2019-12-07 19:13:50,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:13:50" (3/3) ... [2019-12-07 19:13:50,936 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_rmo.opt.i [2019-12-07 19:13:50,943 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:13:50,943 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:13:50,947 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:13:50,948 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:13:50,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,992 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:13:51,007 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:13:51,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:13:51,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:13:51,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:13:51,020 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:13:51,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:13:51,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:13:51,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:13:51,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:13:51,030 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-07 19:13:51,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-07 19:13:51,087 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-07 19:13:51,087 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:13:51,098 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 19:13:51,111 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-07 19:13:51,141 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-07 19:13:51,141 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:13:51,146 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 19:13:51,158 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 19:13:51,159 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:13:53,832 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 19:13:53,979 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-12-07 19:13:53,980 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 19:13:53,982 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-12-07 19:13:54,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-12-07 19:13:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-12-07 19:13:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:13:54,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:54,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:13:54,484 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:54,488 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-12-07 19:13:54,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:54,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257118484] [2019-12-07 19:13:54,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:54,666 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 19:13:54,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257118484] [2019-12-07 19:13:54,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:54,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:13:54,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380024855] [2019-12-07 19:13:54,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:13:54,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:13:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:13:54,682 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-12-07 19:13:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:54,880 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-12-07 19:13:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:13:54,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 19:13:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:54,968 INFO L225 Difference]: With dead ends: 11574 [2019-12-07 19:13:54,968 INFO L226 Difference]: Without dead ends: 10902 [2019-12-07 19:13:54,969 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 19:13:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-07 19:13:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-07 19:13:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-07 19:13:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-12-07 19:13:55,400 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-12-07 19:13:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:55,401 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-12-07 19:13:55,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:13:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-12-07 19:13:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:13:55,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:55,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:13:55,405 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-12-07 19:13:55,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:55,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123997382] [2019-12-07 19:13:55,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:55,455 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 19:13:55,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123997382] [2019-12-07 19:13:55,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:55,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:13:55,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825131457] [2019-12-07 19:13:55,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:13:55,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:13:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:13:55,457 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 3 states. [2019-12-07 19:13:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:55,541 INFO L93 Difference]: Finished difference Result 6581 states and 22068 transitions. [2019-12-07 19:13:55,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:13:55,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 19:13:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:55,572 INFO L225 Difference]: With dead ends: 6581 [2019-12-07 19:13:55,572 INFO L226 Difference]: Without dead ends: 6581 [2019-12-07 19:13:55,572 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 19:13:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-12-07 19:13:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-12-07 19:13:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-12-07 19:13:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 22068 transitions. [2019-12-07 19:13:55,704 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 22068 transitions. Word has length 13 [2019-12-07 19:13:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:55,704 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 22068 transitions. [2019-12-07 19:13:55,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:13:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 22068 transitions. [2019-12-07 19:13:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:13:55,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:55,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:13:55,706 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2047638315, now seen corresponding path program 1 times [2019-12-07 19:13:55,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:55,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609373010] [2019-12-07 19:13:55,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:55,748 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 19:13:55,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609373010] [2019-12-07 19:13:55,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:55,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:13:55,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957451195] [2019-12-07 19:13:55,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:13:55,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:55,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:13:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:13:55,749 INFO L87 Difference]: Start difference. First operand 6581 states and 22068 transitions. Second operand 4 states. [2019-12-07 19:13:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:55,771 INFO L93 Difference]: Finished difference Result 1580 states and 4255 transitions. [2019-12-07 19:13:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:13:55,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:13:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:55,774 INFO L225 Difference]: With dead ends: 1580 [2019-12-07 19:13:55,774 INFO L226 Difference]: Without dead ends: 1580 [2019-12-07 19:13:55,775 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 19:13:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-12-07 19:13:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-12-07 19:13:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-12-07 19:13:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 4255 transitions. [2019-12-07 19:13:55,796 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 4255 transitions. Word has length 14 [2019-12-07 19:13:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:55,796 INFO L462 AbstractCegarLoop]: Abstraction has 1580 states and 4255 transitions. [2019-12-07 19:13:55,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:13:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 4255 transitions. [2019-12-07 19:13:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:13:55,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:55,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:13:55,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-12-07 19:13:55,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:55,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576439158] [2019-12-07 19:13:55,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:55,824 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 19:13:55,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576439158] [2019-12-07 19:13:55,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:55,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:13:55,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462498496] [2019-12-07 19:13:55,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:13:55,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:13:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:13:55,826 INFO L87 Difference]: Start difference. First operand 1580 states and 4255 transitions. Second operand 3 states. [2019-12-07 19:13:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:55,863 INFO L93 Difference]: Finished difference Result 2392 states and 6401 transitions. [2019-12-07 19:13:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:13:55,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 19:13:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:55,868 INFO L225 Difference]: With dead ends: 2392 [2019-12-07 19:13:55,868 INFO L226 Difference]: Without dead ends: 2392 [2019-12-07 19:13:55,868 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 19:13:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-12-07 19:13:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1844. [2019-12-07 19:13:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-07 19:13:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5001 transitions. [2019-12-07 19:13:55,910 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5001 transitions. Word has length 16 [2019-12-07 19:13:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:55,910 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 5001 transitions. [2019-12-07 19:13:55,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:13:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5001 transitions. [2019-12-07 19:13:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:13:55,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:55,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:13:55,911 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-12-07 19:13:55,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:55,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865520489] [2019-12-07 19:13:55,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:55,968 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 19:13:55,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865520489] [2019-12-07 19:13:55,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:55,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:13:55,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677904985] [2019-12-07 19:13:55,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:13:55,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:13:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:13:55,970 INFO L87 Difference]: Start difference. First operand 1844 states and 5001 transitions. Second operand 5 states. [2019-12-07 19:13:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:56,156 INFO L93 Difference]: Finished difference Result 2843 states and 7459 transitions. [2019-12-07 19:13:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:13:56,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 19:13:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:56,160 INFO L225 Difference]: With dead ends: 2843 [2019-12-07 19:13:56,160 INFO L226 Difference]: Without dead ends: 2843 [2019-12-07 19:13:56,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:13:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-07 19:13:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2353. [2019-12-07 19:13:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-12-07 19:13:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 6293 transitions. [2019-12-07 19:13:56,212 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 6293 transitions. Word has length 16 [2019-12-07 19:13:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:56,212 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 6293 transitions. [2019-12-07 19:13:56,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:13:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 6293 transitions. [2019-12-07 19:13:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:13:56,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:56,217 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] [2019-12-07 19:13:56,217 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-12-07 19:13:56,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:56,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105305428] [2019-12-07 19:13:56,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:56,312 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 19:13:56,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105305428] [2019-12-07 19:13:56,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:56,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:13:56,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656931901] [2019-12-07 19:13:56,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:13:56,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:56,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:13:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:13:56,313 INFO L87 Difference]: Start difference. First operand 2353 states and 6293 transitions. Second operand 6 states. [2019-12-07 19:13:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:56,596 INFO L93 Difference]: Finished difference Result 3264 states and 8335 transitions. [2019-12-07 19:13:56,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:13:56,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 19:13:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:56,600 INFO L225 Difference]: With dead ends: 3264 [2019-12-07 19:13:56,601 INFO L226 Difference]: Without dead ends: 3260 [2019-12-07 19:13:56,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:13:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2019-12-07 19:13:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2386. [2019-12-07 19:13:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2019-12-07 19:13:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 6282 transitions. [2019-12-07 19:13:56,644 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 6282 transitions. Word has length 29 [2019-12-07 19:13:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:56,644 INFO L462 AbstractCegarLoop]: Abstraction has 2386 states and 6282 transitions. [2019-12-07 19:13:56,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:13:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 6282 transitions. [2019-12-07 19:13:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:13:56,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:56,649 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] [2019-12-07 19:13:56,649 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash -906757855, now seen corresponding path program 1 times [2019-12-07 19:13:56,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:56,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598180253] [2019-12-07 19:13:56,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:56,702 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 19:13:56,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598180253] [2019-12-07 19:13:56,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:56,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:13:56,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554659184] [2019-12-07 19:13:56,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:13:56,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:13:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:13:56,703 INFO L87 Difference]: Start difference. First operand 2386 states and 6282 transitions. Second operand 5 states. [2019-12-07 19:13:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:56,921 INFO L93 Difference]: Finished difference Result 3538 states and 9205 transitions. [2019-12-07 19:13:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:13:56,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 19:13:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:56,926 INFO L225 Difference]: With dead ends: 3538 [2019-12-07 19:13:56,926 INFO L226 Difference]: Without dead ends: 3538 [2019-12-07 19:13:56,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:13:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2019-12-07 19:13:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3085. [2019-12-07 19:13:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3085 states. [2019-12-07 19:13:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 8122 transitions. [2019-12-07 19:13:56,968 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 8122 transitions. Word has length 29 [2019-12-07 19:13:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:56,968 INFO L462 AbstractCegarLoop]: Abstraction has 3085 states and 8122 transitions. [2019-12-07 19:13:56,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:13:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 8122 transitions. [2019-12-07 19:13:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:13:56,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:56,972 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] [2019-12-07 19:13:56,972 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2140105962, now seen corresponding path program 1 times [2019-12-07 19:13:56,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:56,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707919346] [2019-12-07 19:13:56,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:57,005 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 19:13:57,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707919346] [2019-12-07 19:13:57,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:57,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:13:57,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261488144] [2019-12-07 19:13:57,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:13:57,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:13:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:13:57,006 INFO L87 Difference]: Start difference. First operand 3085 states and 8122 transitions. Second operand 3 states. [2019-12-07 19:13:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:57,022 INFO L93 Difference]: Finished difference Result 3018 states and 7894 transitions. [2019-12-07 19:13:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:13:57,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 19:13:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:57,028 INFO L225 Difference]: With dead ends: 3018 [2019-12-07 19:13:57,029 INFO L226 Difference]: Without dead ends: 3018 [2019-12-07 19:13:57,029 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 19:13:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-12-07 19:13:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2653. [2019-12-07 19:13:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-12-07 19:13:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6957 transitions. [2019-12-07 19:13:57,063 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6957 transitions. Word has length 30 [2019-12-07 19:13:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:57,064 INFO L462 AbstractCegarLoop]: Abstraction has 2653 states and 6957 transitions. [2019-12-07 19:13:57,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:13:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6957 transitions. [2019-12-07 19:13:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:13:57,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:57,067 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] [2019-12-07 19:13:57,067 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1710409753, now seen corresponding path program 1 times [2019-12-07 19:13:57,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:57,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557112303] [2019-12-07 19:13:57,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:57,127 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 19:13:57,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557112303] [2019-12-07 19:13:57,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:57,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:13:57,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967621963] [2019-12-07 19:13:57,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:13:57,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:13:57,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:13:57,128 INFO L87 Difference]: Start difference. First operand 2653 states and 6957 transitions. Second operand 4 states. [2019-12-07 19:13:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:57,153 INFO L93 Difference]: Finished difference Result 4337 states and 10902 transitions. [2019-12-07 19:13:57,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:13:57,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 19:13:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:57,157 INFO L225 Difference]: With dead ends: 4337 [2019-12-07 19:13:57,158 INFO L226 Difference]: Without dead ends: 2654 [2019-12-07 19:13:57,158 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 19:13:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-12-07 19:13:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2634. [2019-12-07 19:13:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2019-12-07 19:13:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 6095 transitions. [2019-12-07 19:13:57,188 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 6095 transitions. Word has length 30 [2019-12-07 19:13:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:57,188 INFO L462 AbstractCegarLoop]: Abstraction has 2634 states and 6095 transitions. [2019-12-07 19:13:57,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:13:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 6095 transitions. [2019-12-07 19:13:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:13:57,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:57,191 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 19:13:57,191 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash 355555592, now seen corresponding path program 1 times [2019-12-07 19:13:57,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:57,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919023578] [2019-12-07 19:13:57,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:57,245 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 19:13:57,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919023578] [2019-12-07 19:13:57,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:57,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:13:57,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025293891] [2019-12-07 19:13:57,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:13:57,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:57,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:13:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:13:57,246 INFO L87 Difference]: Start difference. First operand 2634 states and 6095 transitions. Second operand 4 states. [2019-12-07 19:13:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:57,283 INFO L93 Difference]: Finished difference Result 3910 states and 9143 transitions. [2019-12-07 19:13:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:13:57,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 19:13:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:57,288 INFO L225 Difference]: With dead ends: 3910 [2019-12-07 19:13:57,288 INFO L226 Difference]: Without dead ends: 3574 [2019-12-07 19:13:57,288 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 19:13:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-07 19:13:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3548. [2019-12-07 19:13:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3548 states. [2019-12-07 19:13:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 8232 transitions. [2019-12-07 19:13:57,324 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 8232 transitions. Word has length 31 [2019-12-07 19:13:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:57,324 INFO L462 AbstractCegarLoop]: Abstraction has 3548 states and 8232 transitions. [2019-12-07 19:13:57,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:13:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 8232 transitions. [2019-12-07 19:13:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:13:57,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:57,327 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 19:13:57,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1976107014, now seen corresponding path program 2 times [2019-12-07 19:13:57,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:57,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038120899] [2019-12-07 19:13:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:57,556 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 19:13:57,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038120899] [2019-12-07 19:13:57,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:57,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:13:57,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583950938] [2019-12-07 19:13:57,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:13:57,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:13:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:13:57,557 INFO L87 Difference]: Start difference. First operand 3548 states and 8232 transitions. Second operand 9 states. [2019-12-07 19:13:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:58,135 INFO L93 Difference]: Finished difference Result 7363 states and 16980 transitions. [2019-12-07 19:13:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:13:58,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-12-07 19:13:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:58,141 INFO L225 Difference]: With dead ends: 7363 [2019-12-07 19:13:58,141 INFO L226 Difference]: Without dead ends: 4519 [2019-12-07 19:13:58,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:13:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-12-07 19:13:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 3380. [2019-12-07 19:13:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3380 states. [2019-12-07 19:13:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 7787 transitions. [2019-12-07 19:13:58,179 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 7787 transitions. Word has length 31 [2019-12-07 19:13:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:58,180 INFO L462 AbstractCegarLoop]: Abstraction has 3380 states and 7787 transitions. [2019-12-07 19:13:58,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:13:58,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 7787 transitions. [2019-12-07 19:13:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:13:58,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:58,183 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 19:13:58,183 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1488275650, now seen corresponding path program 3 times [2019-12-07 19:13:58,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:58,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628866371] [2019-12-07 19:13:58,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:58,217 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 19:13:58,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628866371] [2019-12-07 19:13:58,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:58,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:13:58,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743789734] [2019-12-07 19:13:58,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:13:58,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:13:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:13:58,218 INFO L87 Difference]: Start difference. First operand 3380 states and 7787 transitions. Second operand 5 states. [2019-12-07 19:13:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:58,240 INFO L93 Difference]: Finished difference Result 2129 states and 4796 transitions. [2019-12-07 19:13:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:13:58,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 19:13:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:58,242 INFO L225 Difference]: With dead ends: 2129 [2019-12-07 19:13:58,242 INFO L226 Difference]: Without dead ends: 1322 [2019-12-07 19:13:58,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:13:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-07 19:13:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1222. [2019-12-07 19:13:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-07 19:13:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2743 transitions. [2019-12-07 19:13:58,253 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2743 transitions. Word has length 31 [2019-12-07 19:13:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:58,253 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2743 transitions. [2019-12-07 19:13:58,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:13:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2743 transitions. [2019-12-07 19:13:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:13:58,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:58,255 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] [2019-12-07 19:13:58,255 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:58,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1896706635, now seen corresponding path program 1 times [2019-12-07 19:13:58,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:58,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692024936] [2019-12-07 19:13:58,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:58,305 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 19:13:58,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692024936] [2019-12-07 19:13:58,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:58,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:13:58,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687449098] [2019-12-07 19:13:58,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:13:58,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:13:58,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:13:58,306 INFO L87 Difference]: Start difference. First operand 1222 states and 2743 transitions. Second operand 7 states. [2019-12-07 19:13:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:58,445 INFO L93 Difference]: Finished difference Result 2741 states and 5953 transitions. [2019-12-07 19:13:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:13:58,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 19:13:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:58,447 INFO L225 Difference]: With dead ends: 2741 [2019-12-07 19:13:58,447 INFO L226 Difference]: Without dead ends: 1889 [2019-12-07 19:13:58,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:13:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-12-07 19:13:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1263. [2019-12-07 19:13:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-07 19:13:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2809 transitions. [2019-12-07 19:13:58,460 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2809 transitions. Word has length 45 [2019-12-07 19:13:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:58,460 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 2809 transitions. [2019-12-07 19:13:58,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:13:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2809 transitions. [2019-12-07 19:13:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:13:58,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:58,462 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] [2019-12-07 19:13:58,462 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 291811001, now seen corresponding path program 2 times [2019-12-07 19:13:58,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:58,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758702335] [2019-12-07 19:13:58,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:58,651 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 19:13:58,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758702335] [2019-12-07 19:13:58,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:58,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 19:13:58,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905452150] [2019-12-07 19:13:58,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:13:58,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:13:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:13:58,652 INFO L87 Difference]: Start difference. First operand 1263 states and 2809 transitions. Second operand 12 states. [2019-12-07 19:13:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:59,080 INFO L93 Difference]: Finished difference Result 1588 states and 3449 transitions. [2019-12-07 19:13:59,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:13:59,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-07 19:13:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:59,082 INFO L225 Difference]: With dead ends: 1588 [2019-12-07 19:13:59,082 INFO L226 Difference]: Without dead ends: 1391 [2019-12-07 19:13:59,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:13:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-12-07 19:13:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1215. [2019-12-07 19:13:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-07 19:13:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 2707 transitions. [2019-12-07 19:13:59,095 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 2707 transitions. Word has length 45 [2019-12-07 19:13:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:59,095 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 2707 transitions. [2019-12-07 19:13:59,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:13:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 2707 transitions. [2019-12-07 19:13:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:13:59,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:59,097 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] [2019-12-07 19:13:59,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -560648327, now seen corresponding path program 3 times [2019-12-07 19:13:59,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:59,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070385364] [2019-12-07 19:13:59,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:13:59,140 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 19:13:59,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070385364] [2019-12-07 19:13:59,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:13:59,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:13:59,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949734837] [2019-12-07 19:13:59,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:13:59,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:13:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:13:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:13:59,141 INFO L87 Difference]: Start difference. First operand 1215 states and 2707 transitions. Second operand 4 states. [2019-12-07 19:13:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:13:59,154 INFO L93 Difference]: Finished difference Result 1348 states and 2964 transitions. [2019-12-07 19:13:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:13:59,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 19:13:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:13:59,155 INFO L225 Difference]: With dead ends: 1348 [2019-12-07 19:13:59,155 INFO L226 Difference]: Without dead ends: 648 [2019-12-07 19:13:59,155 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 19:13:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-12-07 19:13:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-12-07 19:13:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-12-07 19:13:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1446 transitions. [2019-12-07 19:13:59,166 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1446 transitions. Word has length 45 [2019-12-07 19:13:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:13:59,166 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1446 transitions. [2019-12-07 19:13:59,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:13:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1446 transitions. [2019-12-07 19:13:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:13:59,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:13:59,168 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] [2019-12-07 19:13:59,168 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:13:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:13:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 4 times [2019-12-07 19:13:59,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:13:59,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344034727] [2019-12-07 19:13:59,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:13:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:13:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:13:59,237 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:13:59,237 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:13:59,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t888~0.base_26| 4)) (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= |v_ULTIMATE.start_main_~#t888~0.offset_19| 0) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26|) |v_ULTIMATE.start_main_~#t888~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t888~0.base_26|) (= v_~z$r_buff1_thd0~0_127 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26|) 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ULTIMATE.start_main_~#t888~0.offset=|v_ULTIMATE.start_main_~#t888~0.offset_19|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ULTIMATE.start_main_~#t888~0.base=|v_ULTIMATE.start_main_~#t888~0.base_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t888~0.offset, ULTIMATE.start_main_~#t890~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t889~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t888~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t890~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t889~0.offset, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:13:59,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t889~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t889~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11|) |v_ULTIMATE.start_main_~#t889~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t889~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t889~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t889~0.base, #length, ULTIMATE.start_main_~#t889~0.offset] because there is no mapped edge [2019-12-07 19:13:59,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13|) |v_ULTIMATE.start_main_~#t890~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t890~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t890~0.base_13| 0)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13|)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t890~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t890~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t890~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t890~0.offset] because there is no mapped edge [2019-12-07 19:13:59,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-07 19:13:59,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 19:13:59,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In951762569 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out951762569| ~z$w_buff0_used~0_In951762569) (= |P1Thread1of1ForFork1_#t~ite14_In951762569| |P1Thread1of1ForFork1_#t~ite14_Out951762569|) (not .cse0)) (and (= ~z$w_buff0_used~0_In951762569 |P1Thread1of1ForFork1_#t~ite14_Out951762569|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out951762569| |P1Thread1of1ForFork1_#t~ite14_Out951762569|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In951762569 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd2~0_In951762569 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In951762569 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In951762569 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In951762569, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In951762569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In951762569, ~weak$$choice2~0=~weak$$choice2~0_In951762569, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In951762569, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In951762569|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In951762569, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In951762569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In951762569, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out951762569|, ~weak$$choice2~0=~weak$$choice2~0_In951762569, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out951762569|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In951762569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:13:59,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:13:59,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 19:13:59,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1154118724 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1154118724 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-1154118724| 0)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1154118724| ~z$w_buff0_used~0_In-1154118724) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154118724, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1154118724} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154118724, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1154118724, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1154118724|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 19:13:59,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1297333008 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1297333008 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1297333008 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1297333008 256)))) (or (and (= ~z$w_buff1_used~0_In1297333008 |P2Thread1of1ForFork2_#t~ite29_Out1297333008|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1297333008|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1297333008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1297333008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297333008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1297333008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1297333008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1297333008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297333008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1297333008, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1297333008|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 19:13:59,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-962121412 256))) (.cse0 (= ~z$r_buff0_thd3~0_In-962121412 ~z$r_buff0_thd3~0_Out-962121412)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-962121412 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd3~0_Out-962121412)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-962121412, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-962121412} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-962121412|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-962121412, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-962121412} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 19:13:59,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-491328958 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-491328958 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-491328958 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-491328958 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-491328958|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-491328958 |P2Thread1of1ForFork2_#t~ite31_Out-491328958|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-491328958, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-491328958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491328958, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-491328958} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-491328958|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-491328958, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-491328958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491328958, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-491328958} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 19:13:59,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:13:59,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:13:59,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1704125532 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1704125532 256) 0))) (or (and (= ~z~0_In-1704125532 |ULTIMATE.start_main_#t~ite35_Out-1704125532|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1704125532| ~z$w_buff1~0_In-1704125532) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1704125532, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1704125532, ~z$w_buff1~0=~z$w_buff1~0_In-1704125532, ~z~0=~z~0_In-1704125532} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1704125532, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1704125532|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1704125532, ~z$w_buff1~0=~z$w_buff1~0_In-1704125532, ~z~0=~z~0_In-1704125532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 19:13:59,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 19:13:59,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In598304345 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In598304345 256)))) (or (and (= ~z$w_buff0_used~0_In598304345 |ULTIMATE.start_main_#t~ite37_Out598304345|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out598304345|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In598304345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In598304345} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In598304345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In598304345, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out598304345|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 19:13:59,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1752585936 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1752585936 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1752585936 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1752585936 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out1752585936|)) (and (= ~z$w_buff1_used~0_In1752585936 |ULTIMATE.start_main_#t~ite38_Out1752585936|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1752585936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1752585936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1752585936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1752585936} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1752585936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1752585936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1752585936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1752585936, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1752585936|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:13:59,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1017086292 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1017086292 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1017086292 |ULTIMATE.start_main_#t~ite39_Out1017086292|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1017086292| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1017086292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1017086292} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1017086292, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1017086292|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1017086292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 19:13:59,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1233244242 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1233244242 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1233244242 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1233244242 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1233244242| ~z$r_buff1_thd0~0_In1233244242) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite40_Out1233244242| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1233244242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233244242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1233244242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233244242} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1233244242, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1233244242|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233244242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1233244242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233244242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 19:13:59,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:13:59,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:13:59 BasicIcfg [2019-12-07 19:13:59,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:13:59,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:13:59,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:13:59,302 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:13:59,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:13:50" (3/4) ... [2019-12-07 19:13:59,304 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:13:59,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t888~0.base_26| 4)) (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= |v_ULTIMATE.start_main_~#t888~0.offset_19| 0) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26|) |v_ULTIMATE.start_main_~#t888~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t888~0.base_26|) (= v_~z$r_buff1_thd0~0_127 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26|) 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ULTIMATE.start_main_~#t888~0.offset=|v_ULTIMATE.start_main_~#t888~0.offset_19|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ULTIMATE.start_main_~#t888~0.base=|v_ULTIMATE.start_main_~#t888~0.base_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t888~0.offset, ULTIMATE.start_main_~#t890~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t889~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t888~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t890~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t889~0.offset, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:13:59,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t889~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t889~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11|) |v_ULTIMATE.start_main_~#t889~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t889~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t889~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t889~0.base, #length, ULTIMATE.start_main_~#t889~0.offset] because there is no mapped edge [2019-12-07 19:13:59,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13|) |v_ULTIMATE.start_main_~#t890~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t890~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t890~0.base_13| 0)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13|)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t890~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t890~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t890~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t890~0.offset] because there is no mapped edge [2019-12-07 19:13:59,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-07 19:13:59,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 19:13:59,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In951762569 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out951762569| ~z$w_buff0_used~0_In951762569) (= |P1Thread1of1ForFork1_#t~ite14_In951762569| |P1Thread1of1ForFork1_#t~ite14_Out951762569|) (not .cse0)) (and (= ~z$w_buff0_used~0_In951762569 |P1Thread1of1ForFork1_#t~ite14_Out951762569|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out951762569| |P1Thread1of1ForFork1_#t~ite14_Out951762569|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In951762569 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd2~0_In951762569 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In951762569 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In951762569 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In951762569, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In951762569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In951762569, ~weak$$choice2~0=~weak$$choice2~0_In951762569, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In951762569, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In951762569|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In951762569, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In951762569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In951762569, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out951762569|, ~weak$$choice2~0=~weak$$choice2~0_In951762569, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out951762569|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In951762569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:13:59,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:13:59,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 19:13:59,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1154118724 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1154118724 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-1154118724| 0)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1154118724| ~z$w_buff0_used~0_In-1154118724) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154118724, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1154118724} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154118724, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1154118724, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1154118724|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 19:13:59,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1297333008 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1297333008 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1297333008 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1297333008 256)))) (or (and (= ~z$w_buff1_used~0_In1297333008 |P2Thread1of1ForFork2_#t~ite29_Out1297333008|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1297333008|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1297333008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1297333008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297333008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1297333008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1297333008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1297333008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297333008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1297333008, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1297333008|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 19:13:59,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-962121412 256))) (.cse0 (= ~z$r_buff0_thd3~0_In-962121412 ~z$r_buff0_thd3~0_Out-962121412)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-962121412 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd3~0_Out-962121412)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-962121412, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-962121412} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-962121412|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-962121412, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-962121412} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 19:13:59,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-491328958 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-491328958 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-491328958 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-491328958 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-491328958|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-491328958 |P2Thread1of1ForFork2_#t~ite31_Out-491328958|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-491328958, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-491328958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491328958, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-491328958} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-491328958|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-491328958, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-491328958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-491328958, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-491328958} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 19:13:59,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:13:59,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:13:59,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1704125532 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1704125532 256) 0))) (or (and (= ~z~0_In-1704125532 |ULTIMATE.start_main_#t~ite35_Out-1704125532|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1704125532| ~z$w_buff1~0_In-1704125532) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1704125532, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1704125532, ~z$w_buff1~0=~z$w_buff1~0_In-1704125532, ~z~0=~z~0_In-1704125532} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1704125532, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1704125532|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1704125532, ~z$w_buff1~0=~z$w_buff1~0_In-1704125532, ~z~0=~z~0_In-1704125532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 19:13:59,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 19:13:59,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In598304345 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In598304345 256)))) (or (and (= ~z$w_buff0_used~0_In598304345 |ULTIMATE.start_main_#t~ite37_Out598304345|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out598304345|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In598304345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In598304345} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In598304345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In598304345, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out598304345|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 19:13:59,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1752585936 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1752585936 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1752585936 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1752585936 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out1752585936|)) (and (= ~z$w_buff1_used~0_In1752585936 |ULTIMATE.start_main_#t~ite38_Out1752585936|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1752585936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1752585936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1752585936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1752585936} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1752585936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1752585936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1752585936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1752585936, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1752585936|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:13:59,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1017086292 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1017086292 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1017086292 |ULTIMATE.start_main_#t~ite39_Out1017086292|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1017086292| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1017086292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1017086292} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1017086292, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1017086292|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1017086292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 19:13:59,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1233244242 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1233244242 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1233244242 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1233244242 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1233244242| ~z$r_buff1_thd0~0_In1233244242) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite40_Out1233244242| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1233244242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233244242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1233244242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233244242} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1233244242, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1233244242|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233244242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1233244242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233244242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 19:13:59,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:13:59,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1cf08de0-d5a9-4f26-996b-25a82d737cf8/bin/utaipan/witness.graphml [2019-12-07 19:13:59,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:13:59,368 INFO L168 Benchmark]: Toolchain (without parser) took 9300.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.6 MB). Free memory was 933.5 MB in the beginning and 831.0 MB in the end (delta: 102.5 MB). Peak memory consumption was 472.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:13:59,368 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:13:59,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:13:59,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.26 ms. Allocated memory is still 1.1 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 19:13:59,369 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:13:59,369 INFO L168 Benchmark]: RCFGBuilder took 380.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:13:59,370 INFO L168 Benchmark]: TraceAbstraction took 8370.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 270.5 MB). Free memory was 1.0 GB in the beginning and 855.7 MB in the end (delta: 155.9 MB). Peak memory consumption was 426.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:13:59,370 INFO L168 Benchmark]: Witness Printer took 64.93 ms. Allocated memory is still 1.4 GB. Free memory was 855.7 MB in the beginning and 831.0 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:13:59,371 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.26 ms. Allocated memory is still 1.1 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 24.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8370.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 270.5 MB). Free memory was 1.0 GB in the beginning and 855.7 MB in the end (delta: 155.9 MB). Peak memory consumption was 426.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.93 ms. Allocated memory is still 1.4 GB. Free memory was 855.7 MB in the beginning and 831.0 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1817 SDtfs, 2227 SDslu, 3814 SDs, 0 SdLazy, 2058 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 4817 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 95673 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...