./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/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 ff5c85ebee88b83fb277698b63b87ea24f313b6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:19:55,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:19:55,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:19:55,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:19:55,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:19:55,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:19:55,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:19:55,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:19:55,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:19:55,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:19:55,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:19:55,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:19:55,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:19:55,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:19:55,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:19:55,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:19:55,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:19:55,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:19:55,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:19:55,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:19:55,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:19:55,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:19:55,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:19:55,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:19:55,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:19:55,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:19:55,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:19:55,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:19:55,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:19:55,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:19:55,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:19:55,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:19:55,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:19:55,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:19:55,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:19:55,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:19:55,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:19:55,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:19:55,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:19:55,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:19:55,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:19:55,049 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:19:55,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:19:55,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:19:55,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:19:55,059 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:19:55,060 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:19:55,060 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:19:55,060 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:19:55,060 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:19:55,060 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:19:55,060 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:19:55,060 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:19:55,061 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:19:55,061 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:19:55,061 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:19:55,061 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:19:55,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:19:55,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:19:55,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:19:55,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:55,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:19:55,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:19:55,064 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_a35263a7-3567-4253-a055-26f094821fe0/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 -> ff5c85ebee88b83fb277698b63b87ea24f313b6a [2019-12-07 21:19:55,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:19:55,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:19:55,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:19:55,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:19:55,178 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:19:55,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-12-07 21:19:55,221 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/data/87022eff1/4b7e3e10fec4451a8f6d491fc5892a39/FLAG51133373c [2019-12-07 21:19:55,670 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:19:55,670 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-12-07 21:19:55,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/data/87022eff1/4b7e3e10fec4451a8f6d491fc5892a39/FLAG51133373c [2019-12-07 21:19:55,693 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/data/87022eff1/4b7e3e10fec4451a8f6d491fc5892a39 [2019-12-07 21:19:55,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:19:55,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:19:55,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:55,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:19:55,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:19:55,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:55" (1/1) ... [2019-12-07 21:19:55,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:55, skipping insertion in model container [2019-12-07 21:19:55,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:55" (1/1) ... [2019-12-07 21:19:55,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:19:55,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:19:55,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:55,988 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:19:56,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:56,074 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:19:56,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56 WrapperNode [2019-12-07 21:19:56,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:56,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:56,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:19:56,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:19:56,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:56,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:19:56,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:19:56,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:19:56,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... [2019-12-07 21:19:56,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:19:56,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:19:56,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:19:56,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:19:56,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:19:56,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:19:56,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:19:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:19:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:19:56,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:19:56,182 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:19:56,496 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:19:56,496 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:19:56,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:56 BoogieIcfgContainer [2019-12-07 21:19:56,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:19:56,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:19:56,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:19:56,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:19:56,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:19:55" (1/3) ... [2019-12-07 21:19:56,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62eb207f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:56, skipping insertion in model container [2019-12-07 21:19:56,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:56" (2/3) ... [2019-12-07 21:19:56,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62eb207f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:56, skipping insertion in model container [2019-12-07 21:19:56,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:56" (3/3) ... [2019-12-07 21:19:56,501 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-12-07 21:19:56,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:19:56,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:19:56,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:19:56,513 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:19:56,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:56,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 21:19:56,585 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:19:56,585 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:19:56,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:19:56,586 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:19:56,586 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:19:56,586 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:19:56,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:19:56,586 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:19:56,596 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-07 21:19:56,597 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 21:19:56,646 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 21:19:56,647 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:19:56,657 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 558 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 21:19:56,667 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 21:19:56,696 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 21:19:56,696 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:19:56,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 558 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 21:19:56,708 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 21:19:56,709 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:19:59,270 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 21:19:59,424 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45287 [2019-12-07 21:19:59,424 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-07 21:19:59,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 80 transitions [2019-12-07 21:19:59,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-07 21:19:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-07 21:19:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:19:59,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:59,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:19:59,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 679710407, now seen corresponding path program 1 times [2019-12-07 21:19:59,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:59,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636311903] [2019-12-07 21:19:59,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:59,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636311903] [2019-12-07 21:19:59,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:59,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:19:59,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40850640] [2019-12-07 21:19:59,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:59,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:59,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:59,850 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-07 21:19:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:59,988 INFO L93 Difference]: Finished difference Result 6414 states and 21820 transitions. [2019-12-07 21:19:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:59,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:19:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:00,039 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 21:20:00,039 INFO L226 Difference]: Without dead ends: 6042 [2019-12-07 21:20:00,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-07 21:20:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-07 21:20:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-07 21:20:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20517 transitions. [2019-12-07 21:20:00,256 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20517 transitions. Word has length 5 [2019-12-07 21:20:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:00,256 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20517 transitions. [2019-12-07 21:20:00,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20517 transitions. [2019-12-07 21:20:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:20:00,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:00,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:00,259 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:00,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:00,259 INFO L82 PathProgramCache]: Analyzing trace with hash 200851233, now seen corresponding path program 1 times [2019-12-07 21:20:00,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:00,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688099035] [2019-12-07 21:20:00,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:00,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688099035] [2019-12-07 21:20:00,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:00,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:00,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751682980] [2019-12-07 21:20:00,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:00,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:00,311 INFO L87 Difference]: Start difference. First operand 6042 states and 20517 transitions. Second operand 3 states. [2019-12-07 21:20:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:00,330 INFO L93 Difference]: Finished difference Result 1215 states and 3038 transitions. [2019-12-07 21:20:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:00,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 21:20:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:00,337 INFO L225 Difference]: With dead ends: 1215 [2019-12-07 21:20:00,337 INFO L226 Difference]: Without dead ends: 1215 [2019-12-07 21:20:00,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-07 21:20:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-07 21:20:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-07 21:20:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3038 transitions. [2019-12-07 21:20:00,358 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3038 transitions. Word has length 11 [2019-12-07 21:20:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:00,358 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3038 transitions. [2019-12-07 21:20:00,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3038 transitions. [2019-12-07 21:20:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:20:00,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:00,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:00,360 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:00,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1157318615, now seen corresponding path program 1 times [2019-12-07 21:20:00,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:00,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827614370] [2019-12-07 21:20:00,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:00,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827614370] [2019-12-07 21:20:00,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:00,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:00,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342854016] [2019-12-07 21:20:00,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:00,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:00,396 INFO L87 Difference]: Start difference. First operand 1215 states and 3038 transitions. Second operand 3 states. [2019-12-07 21:20:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:00,445 INFO L93 Difference]: Finished difference Result 1816 states and 4607 transitions. [2019-12-07 21:20:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:00,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 21:20:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:00,454 INFO L225 Difference]: With dead ends: 1816 [2019-12-07 21:20:00,454 INFO L226 Difference]: Without dead ends: 1816 [2019-12-07 21:20:00,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-07 21:20:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1358. [2019-12-07 21:20:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-12-07 21:20:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 3466 transitions. [2019-12-07 21:20:00,484 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 3466 transitions. Word has length 14 [2019-12-07 21:20:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:00,484 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 3466 transitions. [2019-12-07 21:20:00,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 3466 transitions. [2019-12-07 21:20:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:20:00,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:00,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:00,485 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1294893453, now seen corresponding path program 1 times [2019-12-07 21:20:00,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:00,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293542717] [2019-12-07 21:20:00,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:00,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293542717] [2019-12-07 21:20:00,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:00,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:00,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996061738] [2019-12-07 21:20:00,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:00,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:00,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:00,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:00,540 INFO L87 Difference]: Start difference. First operand 1358 states and 3466 transitions. Second operand 4 states. [2019-12-07 21:20:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:00,636 INFO L93 Difference]: Finished difference Result 1779 states and 4379 transitions. [2019-12-07 21:20:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:00,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 21:20:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:00,643 INFO L225 Difference]: With dead ends: 1779 [2019-12-07 21:20:00,644 INFO L226 Difference]: Without dead ends: 1779 [2019-12-07 21:20:00,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-07 21:20:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1647. [2019-12-07 21:20:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-07 21:20:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 4084 transitions. [2019-12-07 21:20:00,669 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 4084 transitions. Word has length 14 [2019-12-07 21:20:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:00,669 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 4084 transitions. [2019-12-07 21:20:00,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 4084 transitions. [2019-12-07 21:20:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:20:00,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:00,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:00,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:00,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1889466766, now seen corresponding path program 1 times [2019-12-07 21:20:00,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:00,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441105746] [2019-12-07 21:20:00,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:00,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441105746] [2019-12-07 21:20:00,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:00,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:00,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654329229] [2019-12-07 21:20:00,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:00,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:00,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:00,714 INFO L87 Difference]: Start difference. First operand 1647 states and 4084 transitions. Second operand 4 states. [2019-12-07 21:20:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:00,817 INFO L93 Difference]: Finished difference Result 2092 states and 5077 transitions. [2019-12-07 21:20:00,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:00,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 21:20:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:00,826 INFO L225 Difference]: With dead ends: 2092 [2019-12-07 21:20:00,826 INFO L226 Difference]: Without dead ends: 2092 [2019-12-07 21:20:00,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2019-12-07 21:20:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1708. [2019-12-07 21:20:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-12-07 21:20:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 4235 transitions. [2019-12-07 21:20:00,852 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 4235 transitions. Word has length 14 [2019-12-07 21:20:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:00,852 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 4235 transitions. [2019-12-07 21:20:00,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 4235 transitions. [2019-12-07 21:20:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:20:00,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:00,854 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] [2019-12-07 21:20:00,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2125431703, now seen corresponding path program 1 times [2019-12-07 21:20:00,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:00,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215293527] [2019-12-07 21:20:00,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:00,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215293527] [2019-12-07 21:20:00,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:00,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:20:00,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008180048] [2019-12-07 21:20:00,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:00,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:00,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:00,929 INFO L87 Difference]: Start difference. First operand 1708 states and 4235 transitions. Second operand 5 states. [2019-12-07 21:20:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:01,179 INFO L93 Difference]: Finished difference Result 2525 states and 6119 transitions. [2019-12-07 21:20:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:20:01,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 21:20:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:01,190 INFO L225 Difference]: With dead ends: 2525 [2019-12-07 21:20:01,190 INFO L226 Difference]: Without dead ends: 2525 [2019-12-07 21:20:01,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 21:20:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-12-07 21:20:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2074. [2019-12-07 21:20:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-07 21:20:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 5075 transitions. [2019-12-07 21:20:01,219 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 5075 transitions. Word has length 26 [2019-12-07 21:20:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:01,219 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 5075 transitions. [2019-12-07 21:20:01,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 5075 transitions. [2019-12-07 21:20:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:20:01,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:01,221 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] [2019-12-07 21:20:01,221 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2116463787, now seen corresponding path program 1 times [2019-12-07 21:20:01,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:01,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657027554] [2019-12-07 21:20:01,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657027554] [2019-12-07 21:20:01,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:01,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77474727] [2019-12-07 21:20:01,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:01,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:01,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:01,255 INFO L87 Difference]: Start difference. First operand 2074 states and 5075 transitions. Second operand 3 states. [2019-12-07 21:20:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:01,288 INFO L93 Difference]: Finished difference Result 2628 states and 6059 transitions. [2019-12-07 21:20:01,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:01,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 21:20:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:01,298 INFO L225 Difference]: With dead ends: 2628 [2019-12-07 21:20:01,298 INFO L226 Difference]: Without dead ends: 2628 [2019-12-07 21:20:01,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2019-12-07 21:20:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 1998. [2019-12-07 21:20:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-07 21:20:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4533 transitions. [2019-12-07 21:20:01,327 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4533 transitions. Word has length 26 [2019-12-07 21:20:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:01,327 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4533 transitions. [2019-12-07 21:20:01,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4533 transitions. [2019-12-07 21:20:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:20:01,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:01,330 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] [2019-12-07 21:20:01,330 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,330 INFO L82 PathProgramCache]: Analyzing trace with hash 474142059, now seen corresponding path program 1 times [2019-12-07 21:20:01,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:01,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798445857] [2019-12-07 21:20:01,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798445857] [2019-12-07 21:20:01,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:01,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:01,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083904216] [2019-12-07 21:20:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:01,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:01,368 INFO L87 Difference]: Start difference. First operand 1998 states and 4533 transitions. Second operand 4 states. [2019-12-07 21:20:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:01,382 INFO L93 Difference]: Finished difference Result 1020 states and 2119 transitions. [2019-12-07 21:20:01,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:01,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 21:20:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:01,384 INFO L225 Difference]: With dead ends: 1020 [2019-12-07 21:20:01,384 INFO L226 Difference]: Without dead ends: 1020 [2019-12-07 21:20:01,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-07 21:20:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 916. [2019-12-07 21:20:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-07 21:20:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1920 transitions. [2019-12-07 21:20:01,396 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1920 transitions. Word has length 26 [2019-12-07 21:20:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:01,396 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1920 transitions. [2019-12-07 21:20:01,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1920 transitions. [2019-12-07 21:20:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 21:20:01,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:01,398 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] [2019-12-07 21:20:01,398 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1317237189, now seen corresponding path program 1 times [2019-12-07 21:20:01,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:01,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421623939] [2019-12-07 21:20:01,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421623939] [2019-12-07 21:20:01,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:01,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:20:01,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535195922] [2019-12-07 21:20:01,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:20:01,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:20:01,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:01,467 INFO L87 Difference]: Start difference. First operand 916 states and 1920 transitions. Second operand 7 states. [2019-12-07 21:20:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:01,639 INFO L93 Difference]: Finished difference Result 2427 states and 4936 transitions. [2019-12-07 21:20:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:20:01,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-07 21:20:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:01,642 INFO L225 Difference]: With dead ends: 2427 [2019-12-07 21:20:01,642 INFO L226 Difference]: Without dead ends: 1586 [2019-12-07 21:20:01,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 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 21:20:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-07 21:20:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 999. [2019-12-07 21:20:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-07 21:20:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2081 transitions. [2019-12-07 21:20:01,657 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2081 transitions. Word has length 41 [2019-12-07 21:20:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:01,658 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2081 transitions. [2019-12-07 21:20:01,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:20:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2081 transitions. [2019-12-07 21:20:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 21:20:01,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:01,660 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] [2019-12-07 21:20:01,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2142063769, now seen corresponding path program 2 times [2019-12-07 21:20:01,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:01,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386725289] [2019-12-07 21:20:01,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386725289] [2019-12-07 21:20:01,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:01,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:01,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496524353] [2019-12-07 21:20:01,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:01,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:01,705 INFO L87 Difference]: Start difference. First operand 999 states and 2081 transitions. Second operand 3 states. [2019-12-07 21:20:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:01,716 INFO L93 Difference]: Finished difference Result 997 states and 2076 transitions. [2019-12-07 21:20:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:01,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 21:20:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:01,718 INFO L225 Difference]: With dead ends: 997 [2019-12-07 21:20:01,718 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 21:20:01,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 21:20:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 858. [2019-12-07 21:20:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-12-07 21:20:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1820 transitions. [2019-12-07 21:20:01,732 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1820 transitions. Word has length 41 [2019-12-07 21:20:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:01,732 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1820 transitions. [2019-12-07 21:20:01,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1820 transitions. [2019-12-07 21:20:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 21:20:01,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:01,734 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] [2019-12-07 21:20:01,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1697663251, now seen corresponding path program 1 times [2019-12-07 21:20:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:01,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675710407] [2019-12-07 21:20:01,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675710407] [2019-12-07 21:20:01,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:01,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:01,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584699971] [2019-12-07 21:20:01,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:01,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:01,775 INFO L87 Difference]: Start difference. First operand 858 states and 1820 transitions. Second operand 4 states. [2019-12-07 21:20:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:01,791 INFO L93 Difference]: Finished difference Result 1449 states and 3069 transitions. [2019-12-07 21:20:01,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:01,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 21:20:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:01,793 INFO L225 Difference]: With dead ends: 1449 [2019-12-07 21:20:01,793 INFO L226 Difference]: Without dead ends: 619 [2019-12-07 21:20:01,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-12-07 21:20:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-12-07 21:20:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-12-07 21:20:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1297 transitions. [2019-12-07 21:20:01,803 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1297 transitions. Word has length 42 [2019-12-07 21:20:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:01,803 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 1297 transitions. [2019-12-07 21:20:01,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1297 transitions. [2019-12-07 21:20:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 21:20:01,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:01,805 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] [2019-12-07 21:20:01,805 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1278221311, now seen corresponding path program 2 times [2019-12-07 21:20:01,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:01,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118505203] [2019-12-07 21:20:01,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:01,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118505203] [2019-12-07 21:20:01,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:01,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:20:01,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776732531] [2019-12-07 21:20:01,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:20:01,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:20:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:01,871 INFO L87 Difference]: Start difference. First operand 619 states and 1297 transitions. Second operand 7 states. [2019-12-07 21:20:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:02,003 INFO L93 Difference]: Finished difference Result 1005 states and 2045 transitions. [2019-12-07 21:20:02,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:20:02,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 21:20:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:02,004 INFO L225 Difference]: With dead ends: 1005 [2019-12-07 21:20:02,004 INFO L226 Difference]: Without dead ends: 658 [2019-12-07 21:20:02,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:20:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-12-07 21:20:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 607. [2019-12-07 21:20:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-07 21:20:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1271 transitions. [2019-12-07 21:20:02,011 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1271 transitions. Word has length 42 [2019-12-07 21:20:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:02,011 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1271 transitions. [2019-12-07 21:20:02,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:20:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1271 transitions. [2019-12-07 21:20:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 21:20:02,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:02,013 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] [2019-12-07 21:20:02,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 416077471, now seen corresponding path program 3 times [2019-12-07 21:20:02,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:02,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961591029] [2019-12-07 21:20:02,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:20:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:20:02,074 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:20:02,074 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:20:02,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_31|) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= 0 v_~__unbuffered_cnt~0_92) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_23|) (= 0 v_~x$r_buff1_thd2~0_200) (= (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31|) 0) (= v_~x$r_buff1_thd0~0_197 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31|) |v_ULTIMATE.start_main_~#t903~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t903~0.base_31| 4) |v_#length_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31| 1) |v_#valid_54|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_28|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_23|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 21:20:02,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-12-07 21:20:02,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= 1 v_~x$w_buff0_used~0_94) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 0)) (= 1 v_~x$w_buff0~0_49) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_94 256))) (not (= (mod v_~x$w_buff1_used~0_53 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 21:20:02,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In880953588 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In880953588 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out880953588|)) (and (= ~x$w_buff0_used~0_In880953588 |P1Thread1of1ForFork0_#t~ite28_Out880953588|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In880953588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In880953588} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In880953588, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out880953588|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In880953588} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 21:20:02,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2065612585 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2065612585 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2065612585 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2065612585 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out2065612585|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out2065612585| ~x$w_buff1_used~0_In2065612585) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2065612585, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2065612585, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2065612585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065612585} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2065612585, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2065612585, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2065612585, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2065612585|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065612585} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 21:20:02,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In712643254 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In712643254 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In712643254 ~x$r_buff0_thd2~0_Out712643254))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out712643254) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In712643254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712643254} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out712643254|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out712643254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712643254} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 21:20:02,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1341320888 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1341320888 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1341320888 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1341320888 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1341320888|)) (and (= ~x$r_buff1_thd2~0_In-1341320888 |P1Thread1of1ForFork0_#t~ite31_Out-1341320888|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1341320888, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1341320888, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1341320888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341320888} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1341320888|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1341320888, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1341320888, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1341320888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341320888} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 21:20:02,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 21:20:02,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 21:20:02,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 21:20:02,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:20:02,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-419507028 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-419507028 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-419507028| ~x$w_buff1~0_In-419507028) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-419507028 |ULTIMATE.start_main_#t~ite34_Out-419507028|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-419507028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419507028, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-419507028, ~x~0=~x~0_In-419507028} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-419507028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419507028, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-419507028, ~x~0=~x~0_In-419507028, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-419507028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 21:20:02,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 21:20:02,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-513230586 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-513230586 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-513230586| ~x$w_buff0_used~0_In-513230586)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-513230586| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513230586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513230586} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513230586, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-513230586|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513230586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 21:20:02,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-760581143 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-760581143 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-760581143 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-760581143 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-760581143| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-760581143 |ULTIMATE.start_main_#t~ite37_Out-760581143|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-760581143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-760581143, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-760581143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760581143} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-760581143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-760581143, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-760581143|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-760581143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760581143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 21:20:02,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2122198848 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2122198848 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out2122198848|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In2122198848 |ULTIMATE.start_main_#t~ite38_Out2122198848|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2122198848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122198848} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2122198848, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2122198848|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122198848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 21:20:02,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1554970754 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1554970754 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1554970754 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1554970754 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1554970754|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1554970754 |ULTIMATE.start_main_#t~ite39_Out-1554970754|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1554970754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1554970754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1554970754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1554970754} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1554970754, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1554970754|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1554970754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1554970754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1554970754} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 21:20:02,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= v_~main$tmp_guard1~0_17 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:20:02,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:20:02 BasicIcfg [2019-12-07 21:20:02,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:20:02,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:20:02,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:20:02,125 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:20:02,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:56" (3/4) ... [2019-12-07 21:20:02,127 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:20:02,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_31|) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= 0 v_~__unbuffered_cnt~0_92) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_23|) (= 0 v_~x$r_buff1_thd2~0_200) (= (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31|) 0) (= v_~x$r_buff1_thd0~0_197 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31|) |v_ULTIMATE.start_main_~#t903~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t903~0.base_31| 4) |v_#length_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31| 1) |v_#valid_54|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_28|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_23|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 21:20:02,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-12-07 21:20:02,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= 1 v_~x$w_buff0_used~0_94) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 0)) (= 1 v_~x$w_buff0~0_49) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_94 256))) (not (= (mod v_~x$w_buff1_used~0_53 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 21:20:02,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In880953588 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In880953588 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out880953588|)) (and (= ~x$w_buff0_used~0_In880953588 |P1Thread1of1ForFork0_#t~ite28_Out880953588|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In880953588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In880953588} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In880953588, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out880953588|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In880953588} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 21:20:02,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2065612585 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2065612585 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2065612585 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2065612585 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out2065612585|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out2065612585| ~x$w_buff1_used~0_In2065612585) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2065612585, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2065612585, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2065612585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065612585} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2065612585, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2065612585, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2065612585, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2065612585|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2065612585} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 21:20:02,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In712643254 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In712643254 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In712643254 ~x$r_buff0_thd2~0_Out712643254))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out712643254) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In712643254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712643254} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out712643254|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out712643254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712643254} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 21:20:02,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1341320888 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1341320888 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1341320888 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1341320888 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1341320888|)) (and (= ~x$r_buff1_thd2~0_In-1341320888 |P1Thread1of1ForFork0_#t~ite31_Out-1341320888|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1341320888, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1341320888, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1341320888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341320888} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1341320888|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1341320888, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1341320888, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1341320888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1341320888} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 21:20:02,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 21:20:02,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 21:20:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 21:20:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:20:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-419507028 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-419507028 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-419507028| ~x$w_buff1~0_In-419507028) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-419507028 |ULTIMATE.start_main_#t~ite34_Out-419507028|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-419507028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419507028, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-419507028, ~x~0=~x~0_In-419507028} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-419507028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419507028, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-419507028, ~x~0=~x~0_In-419507028, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-419507028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 21:20:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 21:20:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-513230586 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-513230586 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-513230586| ~x$w_buff0_used~0_In-513230586)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-513230586| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513230586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513230586} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513230586, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-513230586|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513230586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 21:20:02,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-760581143 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-760581143 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-760581143 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-760581143 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-760581143| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-760581143 |ULTIMATE.start_main_#t~ite37_Out-760581143|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-760581143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-760581143, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-760581143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760581143} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-760581143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-760581143, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-760581143|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-760581143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760581143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 21:20:02,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2122198848 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2122198848 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out2122198848|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In2122198848 |ULTIMATE.start_main_#t~ite38_Out2122198848|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2122198848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122198848} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2122198848, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2122198848|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122198848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 21:20:02,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1554970754 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1554970754 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1554970754 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1554970754 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1554970754|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1554970754 |ULTIMATE.start_main_#t~ite39_Out-1554970754|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1554970754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1554970754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1554970754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1554970754} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1554970754, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1554970754|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1554970754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1554970754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1554970754} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 21:20:02,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= v_~main$tmp_guard1~0_17 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:20:02,184 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a35263a7-3567-4253-a055-26f094821fe0/bin/utaipan/witness.graphml [2019-12-07 21:20:02,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:20:02,185 INFO L168 Benchmark]: Toolchain (without parser) took 6488.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 937.3 MB in the beginning and 845.7 MB in the end (delta: 91.5 MB). Peak memory consumption was 301.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:02,186 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:02,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:02,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.23 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 21:20:02,187 INFO L168 Benchmark]: Boogie Preprocessor took 23.07 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 21:20:02,187 INFO L168 Benchmark]: RCFGBuilder took 362.03 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:02,187 INFO L168 Benchmark]: TraceAbstraction took 5626.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.5 MB). Free memory was 1.0 GB in the beginning and 863.6 MB in the end (delta: 150.6 MB). Peak memory consumption was 258.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:02,188 INFO L168 Benchmark]: Witness Printer took 59.74 ms. Allocated memory is still 1.2 GB. Free memory was 863.6 MB in the beginning and 845.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:02,189 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.23 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 23.07 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 362.03 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5626.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.5 MB). Free memory was 1.0 GB in the beginning and 863.6 MB in the end (delta: 150.6 MB). Peak memory consumption was 258.1 MB. Max. memory is 11.5 GB. * Witness Printer took 59.74 ms. Allocated memory is still 1.2 GB. Free memory was 863.6 MB in the beginning and 845.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 80 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 18 ChoiceCompositions, 4487 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 190 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 45287 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 5.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1358 SDtfs, 1140 SDslu, 2491 SDs, 0 SdLazy, 950 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred 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.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2936 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 31821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...