./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.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_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/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 b2d24d3ae81594ba0d7b985cc9ef6dcac2d56b17 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:02:44,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:02:44,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:02:44,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:02:44,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:02:44,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:02:44,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:02:44,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:02:44,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:02:44,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:02:44,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:02:44,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:02:44,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:02:44,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:02:44,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:02:44,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:02:44,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:02:44,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:02:44,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:02:44,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:02:44,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:02:44,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:02:44,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:02:44,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:02:44,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:02:44,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:02:44,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:02:44,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:02:44,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:02:44,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:02:44,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:02:44,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:02:44,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:02:44,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:02:44,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:02:44,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:02:44,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:02:44,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:02:44,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:02:44,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:02:44,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:02:44,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:02:44,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:02:44,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:02:44,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:02:44,384 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:02:44,385 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:02:44,385 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:02:44,386 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:02:44,386 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:02:44,386 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:02:44,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:02:44,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:02:44,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:02:44,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:02:44,388 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:02:44,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:02:44,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:02:44,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:02:44,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:02:44,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:02:44,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:02:44,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:02:44,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:02:44,389 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:02:44,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:02:44,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:02:44,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:02:44,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:02:44,389 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_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/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 -> b2d24d3ae81594ba0d7b985cc9ef6dcac2d56b17 [2019-12-07 12:02:44,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:02:44,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:02:44,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:02:44,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:02:44,507 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:02:44,508 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_power.opt.i [2019-12-07 12:02:44,553 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/data/3a590cd0c/3e1d756d30104adba916288c2db999fe/FLAGff52af3d0 [2019-12-07 12:02:45,005 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:02:45,005 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/sv-benchmarks/c/pthread-wmm/mix012_power.opt.i [2019-12-07 12:02:45,015 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/data/3a590cd0c/3e1d756d30104adba916288c2db999fe/FLAGff52af3d0 [2019-12-07 12:02:45,023 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/data/3a590cd0c/3e1d756d30104adba916288c2db999fe [2019-12-07 12:02:45,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:02:45,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:02:45,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:02:45,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:02:45,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:02:45,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45, skipping insertion in model container [2019-12-07 12:02:45,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:02:45,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:02:45,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:02:45,301 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:02:45,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:02:45,389 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:02:45,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45 WrapperNode [2019-12-07 12:02:45,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:02:45,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:02:45,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:02:45,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:02:45,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:02:45,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:02:45,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:02:45,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:02:45,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... [2019-12-07 12:02:45,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:02:45,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:02:45,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:02:45,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:02:45,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/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 12:02:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:02:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:02:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:02:45,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:02:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:02:45,500 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 12:02:45,842 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:02:45,843 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:02:45,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:02:45 BoogieIcfgContainer [2019-12-07 12:02:45,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:02:45,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:02:45,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:02:45,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:02:45,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:02:45" (1/3) ... [2019-12-07 12:02:45,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac3dd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:02:45, skipping insertion in model container [2019-12-07 12:02:45,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:02:45" (2/3) ... [2019-12-07 12:02:45,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac3dd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:02:45, skipping insertion in model container [2019-12-07 12:02:45,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:02:45" (3/3) ... [2019-12-07 12:02:45,849 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.opt.i [2019-12-07 12:02:45,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:02:45,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:02:45,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:02:45,861 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:02:45,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:02:45,922 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:02:45,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:02:45,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:02:45,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:02:45,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:02:45,937 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:02:45,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:02:45,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:02:45,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:02:45,947 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 12:02:45,948 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 12:02:46,003 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 12:02:46,003 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:02:46,011 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:02:46,022 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 12:02:46,048 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 12:02:46,048 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:02:46,052 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:02:46,062 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 12:02:46,063 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:02:48,813 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 12:02:49,071 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-07 12:02:49,071 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 12:02:49,074 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 12:02:49,434 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-07 12:02:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-07 12:02:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:02:49,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:49,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:02:49,441 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-07 12:02:49,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:49,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8029176] [2019-12-07 12:02:49,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:49,602 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 12:02:49,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8029176] [2019-12-07 12:02:49,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:49,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:02:49,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646829627] [2019-12-07 12:02:49,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:49,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:49,618 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-07 12:02:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:49,803 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-07 12:02:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:49,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:02:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:49,861 INFO L225 Difference]: With dead ends: 8760 [2019-12-07 12:02:49,861 INFO L226 Difference]: Without dead ends: 7798 [2019-12-07 12:02:49,862 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 12:02:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-07 12:02:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-07 12:02:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-07 12:02:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-07 12:02:50,140 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-07 12:02:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:50,140 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-07 12:02:50,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-07 12:02:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:02:50,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:50,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:50,143 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-07 12:02:50,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:50,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081477776] [2019-12-07 12:02:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:50,188 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 12:02:50,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081477776] [2019-12-07 12:02:50,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:50,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:50,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016764778] [2019-12-07 12:02:50,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:50,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:50,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:50,191 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-07 12:02:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:50,208 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-07 12:02:50,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:50,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 12:02:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:50,214 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 12:02:50,215 INFO L226 Difference]: Without dead ends: 1232 [2019-12-07 12:02:50,215 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 12:02:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-07 12:02:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-07 12:02:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-07 12:02:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-07 12:02:50,276 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-07 12:02:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:50,276 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-07 12:02:50,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-07 12:02:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:02:50,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:50,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:50,278 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-07 12:02:50,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:50,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485628883] [2019-12-07 12:02:50,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:50,359 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 12:02:50,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485628883] [2019-12-07 12:02:50,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:50,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:50,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631923258] [2019-12-07 12:02:50,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:02:50,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:02:50,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:50,361 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-07 12:02:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:50,573 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-07 12:02:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:02:50,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:02:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:50,581 INFO L225 Difference]: With dead ends: 1829 [2019-12-07 12:02:50,581 INFO L226 Difference]: Without dead ends: 1829 [2019-12-07 12:02:50,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:02:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-07 12:02:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-07 12:02:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-07 12:02:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-07 12:02:50,616 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-07 12:02:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:50,616 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-07 12:02:50,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:02:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-07 12:02:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:02:50,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:50,618 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] [2019-12-07 12:02:50,619 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-07 12:02:50,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:50,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105643969] [2019-12-07 12:02:50,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:50,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 12:02:50,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105643969] [2019-12-07 12:02:50,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:50,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:02:50,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803357501] [2019-12-07 12:02:50,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:02:50,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:50,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:02:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:02:50,705 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-07 12:02:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:50,963 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-07 12:02:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:02:50,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 12:02:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:50,973 INFO L225 Difference]: With dead ends: 2337 [2019-12-07 12:02:50,973 INFO L226 Difference]: Without dead ends: 2337 [2019-12-07 12:02:50,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:02:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-07 12:02:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-07 12:02:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-07 12:02:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-07 12:02:51,002 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-07 12:02:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:51,002 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-07 12:02:51,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:02:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-07 12:02:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:02:51,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:51,004 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 12:02:51,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-07 12:02:51,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:51,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101350512] [2019-12-07 12:02:51,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:51,066 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 12:02:51,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101350512] [2019-12-07 12:02:51,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:51,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:02:51,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073440743] [2019-12-07 12:02:51,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:02:51,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:02:51,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:02:51,068 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-12-07 12:02:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:51,352 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-12-07 12:02:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:02:51,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:02:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:51,363 INFO L225 Difference]: With dead ends: 2417 [2019-12-07 12:02:51,363 INFO L226 Difference]: Without dead ends: 2417 [2019-12-07 12:02:51,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:02:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-12-07 12:02:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-12-07 12:02:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-12-07 12:02:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-12-07 12:02:51,404 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-12-07 12:02:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:51,404 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-12-07 12:02:51,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:02:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-12-07 12:02:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:02:51,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:51,407 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] [2019-12-07 12:02:51,408 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-12-07 12:02:51,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192187434] [2019-12-07 12:02:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:51,461 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 12:02:51,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192187434] [2019-12-07 12:02:51,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:51,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:51,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686309123] [2019-12-07 12:02:51,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:02:51,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:02:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:02:51,462 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-12-07 12:02:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:51,479 INFO L93 Difference]: Finished difference Result 2123 states and 4673 transitions. [2019-12-07 12:02:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:02:51,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:02:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:51,491 INFO L225 Difference]: With dead ends: 2123 [2019-12-07 12:02:51,491 INFO L226 Difference]: Without dead ends: 2123 [2019-12-07 12:02:51,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 12:02:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-07 12:02:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2019-12-07 12:02:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2019-12-07 12:02:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 4673 transitions. [2019-12-07 12:02:51,523 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 4673 transitions. Word has length 27 [2019-12-07 12:02:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:51,523 INFO L462 AbstractCegarLoop]: Abstraction has 2123 states and 4673 transitions. [2019-12-07 12:02:51,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:02:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 4673 transitions. [2019-12-07 12:02:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:02:51,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:51,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:51,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1108446324, now seen corresponding path program 1 times [2019-12-07 12:02:51,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:51,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153547616] [2019-12-07 12:02:51,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:02:51,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153547616] [2019-12-07 12:02:51,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:51,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:51,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697489692] [2019-12-07 12:02:51,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:02:51,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:51,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:02:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:02:51,558 INFO L87 Difference]: Start difference. First operand 2123 states and 4673 transitions. Second operand 4 states. [2019-12-07 12:02:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:51,568 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-12-07 12:02:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:02:51,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 12:02:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:51,571 INFO L225 Difference]: With dead ends: 1195 [2019-12-07 12:02:51,571 INFO L226 Difference]: Without dead ends: 1195 [2019-12-07 12:02:51,571 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 12:02:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-12-07 12:02:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-12-07 12:02:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-07 12:02:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-12-07 12:02:51,586 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 28 [2019-12-07 12:02:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:51,586 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-12-07 12:02:51,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:02:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-12-07 12:02:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 12:02:51,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:51,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:51,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-12-07 12:02:51,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:51,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795948841] [2019-12-07 12:02:51,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:51,660 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 12:02:51,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795948841] [2019-12-07 12:02:51,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:51,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:02:51,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237257915] [2019-12-07 12:02:51,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:02:51,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:51,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:02:51,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:02:51,661 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-12-07 12:02:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:52,078 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-12-07 12:02:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:02:52,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 12:02:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:52,081 INFO L225 Difference]: With dead ends: 1596 [2019-12-07 12:02:52,081 INFO L226 Difference]: Without dead ends: 1590 [2019-12-07 12:02:52,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:02:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-07 12:02:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-12-07 12:02:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-12-07 12:02:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-12-07 12:02:52,101 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-12-07 12:02:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:52,101 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-12-07 12:02:52,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:02:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-12-07 12:02:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 12:02:52,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:52,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:52,104 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-12-07 12:02:52,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:52,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295447689] [2019-12-07 12:02:52,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:52,154 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 12:02:52,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295447689] [2019-12-07 12:02:52,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:52,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:52,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486697096] [2019-12-07 12:02:52,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:52,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:52,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:52,155 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-12-07 12:02:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:52,196 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-12-07 12:02:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:52,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 12:02:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:52,199 INFO L225 Difference]: With dead ends: 1575 [2019-12-07 12:02:52,199 INFO L226 Difference]: Without dead ends: 1575 [2019-12-07 12:02:52,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:02:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-12-07 12:02:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-12-07 12:02:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-07 12:02:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-12-07 12:02:52,215 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-12-07 12:02:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:52,216 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-12-07 12:02:52,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-12-07 12:02:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:02:52,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:52,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:52,218 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-12-07 12:02:52,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:52,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459360738] [2019-12-07 12:02:52,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:52,359 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 12:02:52,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459360738] [2019-12-07 12:02:52,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:52,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:02:52,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675852803] [2019-12-07 12:02:52,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:02:52,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:02:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:02:52,361 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 10 states. [2019-12-07 12:02:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:53,054 INFO L93 Difference]: Finished difference Result 1987 states and 4096 transitions. [2019-12-07 12:02:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 12:02:53,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-07 12:02:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:53,057 INFO L225 Difference]: With dead ends: 1987 [2019-12-07 12:02:53,057 INFO L226 Difference]: Without dead ends: 1987 [2019-12-07 12:02:53,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:02:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-12-07 12:02:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1323. [2019-12-07 12:02:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-12-07 12:02:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2817 transitions. [2019-12-07 12:02:53,075 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2817 transitions. Word has length 51 [2019-12-07 12:02:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:53,076 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 2817 transitions. [2019-12-07 12:02:53,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:02:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2817 transitions. [2019-12-07 12:02:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:02:53,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:53,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:53,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:53,078 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-12-07 12:02:53,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:53,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984797917] [2019-12-07 12:02:53,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:53,121 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 12:02:53,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984797917] [2019-12-07 12:02:53,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:53,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:02:53,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347797757] [2019-12-07 12:02:53,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:53,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:53,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:53,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:53,122 INFO L87 Difference]: Start difference. First operand 1323 states and 2817 transitions. Second operand 3 states. [2019-12-07 12:02:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:53,134 INFO L93 Difference]: Finished difference Result 1322 states and 2815 transitions. [2019-12-07 12:02:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:53,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 12:02:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:53,137 INFO L225 Difference]: With dead ends: 1322 [2019-12-07 12:02:53,137 INFO L226 Difference]: Without dead ends: 1322 [2019-12-07 12:02:53,138 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 12:02:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-07 12:02:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 970. [2019-12-07 12:02:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-12-07 12:02:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2096 transitions. [2019-12-07 12:02:53,156 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2096 transitions. Word has length 51 [2019-12-07 12:02:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:53,156 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 2096 transitions. [2019-12-07 12:02:53,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2096 transitions. [2019-12-07 12:02:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:02:53,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:53,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:53,159 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1353726900, now seen corresponding path program 1 times [2019-12-07 12:02:53,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:53,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876223197] [2019-12-07 12:02:53,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:53,306 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 12:02:53,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876223197] [2019-12-07 12:02:53,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:53,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:02:53,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286301880] [2019-12-07 12:02:53,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:02:53,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:02:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:02:53,307 INFO L87 Difference]: Start difference. First operand 970 states and 2096 transitions. Second operand 10 states. [2019-12-07 12:02:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:53,729 INFO L93 Difference]: Finished difference Result 2449 states and 5226 transitions. [2019-12-07 12:02:53,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:02:53,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 12:02:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:53,730 INFO L225 Difference]: With dead ends: 2449 [2019-12-07 12:02:53,731 INFO L226 Difference]: Without dead ends: 795 [2019-12-07 12:02:53,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:02:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-07 12:02:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2019-12-07 12:02:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-07 12:02:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-12-07 12:02:53,740 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 52 [2019-12-07 12:02:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:53,740 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-12-07 12:02:53,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:02:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-12-07 12:02:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:02:53,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:53,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:53,741 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 2 times [2019-12-07 12:02:53,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:53,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546250589] [2019-12-07 12:02:53,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:53,950 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 12:02:53,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546250589] [2019-12-07 12:02:53,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:53,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:02:53,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439470821] [2019-12-07 12:02:53,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:02:53,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:02:53,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:02:53,952 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 14 states. [2019-12-07 12:02:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:54,428 INFO L93 Difference]: Finished difference Result 1182 states and 2418 transitions. [2019-12-07 12:02:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:02:54,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-12-07 12:02:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:54,430 INFO L225 Difference]: With dead ends: 1182 [2019-12-07 12:02:54,430 INFO L226 Difference]: Without dead ends: 880 [2019-12-07 12:02:54,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:02:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-12-07 12:02:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 779. [2019-12-07 12:02:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-12-07 12:02:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1654 transitions. [2019-12-07 12:02:54,440 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1654 transitions. Word has length 52 [2019-12-07 12:02:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:54,440 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1654 transitions. [2019-12-07 12:02:54,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:02:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1654 transitions. [2019-12-07 12:02:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:02:54,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:54,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:54,441 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 461171952, now seen corresponding path program 1 times [2019-12-07 12:02:54,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:54,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585480929] [2019-12-07 12:02:54,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:54,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 12:02:54,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585480929] [2019-12-07 12:02:54,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:54,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:02:54,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842154549] [2019-12-07 12:02:54,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:54,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:54,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:54,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:54,466 INFO L87 Difference]: Start difference. First operand 779 states and 1654 transitions. Second operand 3 states. [2019-12-07 12:02:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:54,489 INFO L93 Difference]: Finished difference Result 1114 states and 2352 transitions. [2019-12-07 12:02:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:54,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 12:02:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:54,491 INFO L225 Difference]: With dead ends: 1114 [2019-12-07 12:02:54,491 INFO L226 Difference]: Without dead ends: 1114 [2019-12-07 12:02:54,492 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 12:02:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2019-12-07 12:02:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 901. [2019-12-07 12:02:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-07 12:02:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1920 transitions. [2019-12-07 12:02:54,502 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1920 transitions. Word has length 52 [2019-12-07 12:02:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:54,503 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1920 transitions. [2019-12-07 12:02:54,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1920 transitions. [2019-12-07 12:02:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:02:54,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:54,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:54,504 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:54,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2035948482, now seen corresponding path program 3 times [2019-12-07 12:02:54,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:54,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657880690] [2019-12-07 12:02:54,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:54,570 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 12:02:54,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657880690] [2019-12-07 12:02:54,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:54,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:02:54,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769808110] [2019-12-07 12:02:54,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:02:54,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:02:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:02:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:02:54,571 INFO L87 Difference]: Start difference. First operand 901 states and 1920 transitions. Second operand 7 states. [2019-12-07 12:02:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:54,680 INFO L93 Difference]: Finished difference Result 1567 states and 3261 transitions. [2019-12-07 12:02:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:02:54,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 12:02:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:54,682 INFO L225 Difference]: With dead ends: 1567 [2019-12-07 12:02:54,682 INFO L226 Difference]: Without dead ends: 1025 [2019-12-07 12:02:54,682 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 12:02:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-12-07 12:02:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 869. [2019-12-07 12:02:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-07 12:02:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1840 transitions. [2019-12-07 12:02:54,693 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1840 transitions. Word has length 52 [2019-12-07 12:02:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:54,693 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1840 transitions. [2019-12-07 12:02:54,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:02:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1840 transitions. [2019-12-07 12:02:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:02:54,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:54,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:54,694 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 4 times [2019-12-07 12:02:54,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:02:54,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438306415] [2019-12-07 12:02:54,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:02:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:02:54,757 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:02:54,758 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:02:54,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t307~0.base_27| 4) |v_#length_17|) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= |v_ULTIMATE.start_main_~#t307~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t307~0.base_27|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t307~0.base_27|)) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t307~0.base_27| 1) |v_#valid_61|) (= v_~main$tmp_guard1~0_47 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_27|) |v_ULTIMATE.start_main_~#t307~0.offset_19| 0)) |v_#memory_int_11|) (= v_~x~0_99 0) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_20|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ULTIMATE.start_main_~#t307~0.base=|v_ULTIMATE.start_main_~#t307~0.base_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ULTIMATE.start_main_~#t307~0.offset=|v_ULTIMATE.start_main_~#t307~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t308~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t307~0.base, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t308~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t307~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:02:54,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t308~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10|) |v_ULTIMATE.start_main_~#t308~0.offset_9| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t308~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t308~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t308~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t308~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t308~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:02:54,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In1607875120 ~__unbuffered_p0_EAX~0_Out1607875120) (= 1 ~y$r_buff0_thd1~0_Out1607875120) (= ~y$r_buff1_thd2~0_Out1607875120 ~y$r_buff0_thd2~0_In1607875120) (= ~y$r_buff0_thd0~0_In1607875120 ~y$r_buff1_thd0~0_Out1607875120) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1607875120)) (= ~y$r_buff1_thd1~0_Out1607875120 ~y$r_buff0_thd1~0_In1607875120)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1607875120, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1607875120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1607875120, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1607875120, ~x~0=~x~0_In1607875120} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1607875120, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1607875120, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1607875120, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1607875120, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1607875120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1607875120, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1607875120, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1607875120, ~x~0=~x~0_In1607875120} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:02:54,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1009192621 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1009192621 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1009192621| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1009192621| ~y$w_buff0_used~0_In-1009192621) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009192621, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009192621} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1009192621|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009192621, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009192621} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:02:54,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1059000688 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1059000688 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1059000688 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1059000688 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1059000688| ~y$w_buff1_used~0_In-1059000688) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1059000688| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1059000688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1059000688, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1059000688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1059000688} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1059000688|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1059000688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1059000688, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1059000688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1059000688} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:02:54,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In61331205 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out61331205 ~y$r_buff0_thd1~0_In61331205)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In61331205 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out61331205 0)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In61331205, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In61331205} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In61331205, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out61331205|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out61331205} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:02:54,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1508630165 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1508630165 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1508630165 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1508630165 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1508630165| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1508630165| ~y$r_buff1_thd1~0_In-1508630165) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1508630165|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:02:54,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:02:54,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-290504639 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-290504639| |P1Thread1of1ForFork1_#t~ite17_Out-290504639|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-290504639 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-290504639 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-290504639 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-290504639 256))))) .cse1 (= ~y$w_buff1~0_In-290504639 |P1Thread1of1ForFork1_#t~ite17_Out-290504639|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite17_In-290504639| |P1Thread1of1ForFork1_#t~ite17_Out-290504639|) (= |P1Thread1of1ForFork1_#t~ite18_Out-290504639| ~y$w_buff1~0_In-290504639)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-290504639, ~y$w_buff1~0=~y$w_buff1~0_In-290504639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-290504639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-290504639, ~weak$$choice2~0=~weak$$choice2~0_In-290504639, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-290504639|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290504639} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-290504639, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-290504639|, ~y$w_buff1~0=~y$w_buff1~0_In-290504639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-290504639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-290504639, ~weak$$choice2~0=~weak$$choice2~0_In-290504639, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-290504639|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290504639} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:02:54,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-875969495 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-875969495| |P1Thread1of1ForFork1_#t~ite20_Out-875969495|) (= ~y$w_buff0_used~0_In-875969495 |P1Thread1of1ForFork1_#t~ite20_Out-875969495|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-875969495 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-875969495 256) 0)) (= (mod ~y$w_buff0_used~0_In-875969495 256) 0) (and (= (mod ~y$w_buff1_used~0_In-875969495 256) 0) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-875969495| |P1Thread1of1ForFork1_#t~ite20_Out-875969495|) (= |P1Thread1of1ForFork1_#t~ite21_Out-875969495| ~y$w_buff0_used~0_In-875969495)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-875969495, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-875969495, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-875969495|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-875969495, ~weak$$choice2~0=~weak$$choice2~0_In-875969495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-875969495} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-875969495, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-875969495, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-875969495|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-875969495, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-875969495|, ~weak$$choice2~0=~weak$$choice2~0_In-875969495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-875969495} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:02:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite24_Out-1245542242| |P1Thread1of1ForFork1_#t~ite23_Out-1245542242|)) (.cse4 (= (mod ~y$w_buff1_used~0_In-1245542242 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1245542242 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1245542242 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1245542242 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1245542242 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1245542242|) .cse2 (not .cse3) (or .cse1 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1245542242| |P1Thread1of1ForFork1_#t~ite22_Out-1245542242|) .cse5)) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1245542242| |P1Thread1of1ForFork1_#t~ite23_In-1245542242|) (= ~y$w_buff1_used~0_In-1245542242 |P1Thread1of1ForFork1_#t~ite24_Out-1245542242|) (not .cse5)) (and (= ~y$w_buff1_used~0_In-1245542242 |P1Thread1of1ForFork1_#t~ite23_Out-1245542242|) .cse2 (or (and .cse4 .cse6) (and .cse0 .cse6) .cse3) .cse5)) (= |P1Thread1of1ForFork1_#t~ite22_In-1245542242| |P1Thread1of1ForFork1_#t~ite22_Out-1245542242|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245542242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245542242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245542242, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1245542242|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1245542242|, ~weak$$choice2~0=~weak$$choice2~0_In-1245542242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245542242} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245542242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245542242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245542242, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1245542242|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1245542242|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1245542242|, ~weak$$choice2~0=~weak$$choice2~0_In-1245542242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245542242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 12:02:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:02:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1346447731 256) 0))) (or (let ((.cse0 (not (= (mod ~y$r_buff0_thd2~0_In1346447731 256) 0)))) (and (or (not (= 0 (mod ~y$r_buff1_thd2~0_In1346447731 256))) .cse0) .cse1 (or .cse0 (not (= (mod ~y$w_buff1_used~0_In1346447731 256) 0))) (= |P1Thread1of1ForFork1_#t~ite28_Out1346447731| |P1Thread1of1ForFork1_#t~ite29_Out1346447731|) (not (= 0 (mod ~y$w_buff0_used~0_In1346447731 256))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1346447731|) (= |P1Thread1of1ForFork1_#t~ite30_Out1346447731| |P1Thread1of1ForFork1_#t~ite29_Out1346447731|))) (and (= |P1Thread1of1ForFork1_#t~ite28_In1346447731| |P1Thread1of1ForFork1_#t~ite28_Out1346447731|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1346447731| |P1Thread1of1ForFork1_#t~ite29_Out1346447731|) (= ~y$r_buff1_thd2~0_In1346447731 |P1Thread1of1ForFork1_#t~ite30_Out1346447731|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1346447731, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1346447731|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1346447731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1346447731, ~weak$$choice2~0=~weak$$choice2~0_In1346447731, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1346447731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1346447731} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1346447731, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1346447731|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1346447731|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1346447731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1346447731, ~weak$$choice2~0=~weak$$choice2~0_In1346447731, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1346447731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1346447731} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:02:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:02:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-624327305 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-624327305| |P1Thread1of1ForFork1_#t~ite33_Out-624327305|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-624327305 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-624327305| ~y~0_In-624327305) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-624327305| ~y$w_buff1~0_In-624327305) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-624327305, ~y$w_buff1~0=~y$w_buff1~0_In-624327305, ~y~0=~y~0_In-624327305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-624327305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-624327305, ~y$w_buff1~0=~y$w_buff1~0_In-624327305, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-624327305|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-624327305|, ~y~0=~y~0_In-624327305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-624327305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 12:02:54,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In357285951 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In357285951 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out357285951| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out357285951| ~y$w_buff0_used~0_In357285951)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In357285951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In357285951} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In357285951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In357285951, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out357285951|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:02:54,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1379516204 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1379516204 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1379516204 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1379516204 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1379516204 |P1Thread1of1ForFork1_#t~ite35_Out1379516204|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1379516204| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379516204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379516204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379516204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379516204} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379516204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379516204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379516204, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1379516204|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379516204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:02:54,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In127354307 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In127354307 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out127354307|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In127354307 |P1Thread1of1ForFork1_#t~ite36_Out127354307|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In127354307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In127354307} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In127354307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In127354307, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out127354307|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:02:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In80807334 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In80807334 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In80807334 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In80807334 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out80807334|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In80807334 |P1Thread1of1ForFork1_#t~ite37_Out80807334|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In80807334, ~y$w_buff0_used~0=~y$w_buff0_used~0_In80807334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In80807334, ~y$w_buff1_used~0=~y$w_buff1_used~0_In80807334} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In80807334, ~y$w_buff0_used~0=~y$w_buff0_used~0_In80807334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In80807334, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out80807334|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In80807334} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:02:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:02:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:02:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1428225286 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1428225286 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1428225286| ~y$w_buff1~0_In-1428225286) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1428225286| ~y~0_In-1428225286)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1428225286, ~y~0=~y~0_In-1428225286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1428225286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1428225286} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1428225286|, ~y$w_buff1~0=~y$w_buff1~0_In-1428225286, ~y~0=~y~0_In-1428225286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1428225286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1428225286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:02:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 12:02:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In31263795 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In31263795 256)))) (or (and (= ~y$w_buff0_used~0_In31263795 |ULTIMATE.start_main_#t~ite42_Out31263795|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out31263795|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In31263795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In31263795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In31263795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In31263795, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out31263795|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:02:54,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In304116532 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In304116532 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In304116532 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In304116532 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out304116532|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In304116532 |ULTIMATE.start_main_#t~ite43_Out304116532|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In304116532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In304116532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In304116532} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In304116532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out304116532|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In304116532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In304116532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:02:54,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-734442685 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-734442685 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-734442685|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-734442685 |ULTIMATE.start_main_#t~ite44_Out-734442685|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-734442685, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-734442685} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-734442685, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-734442685, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-734442685|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:02:54,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1238192650 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1238192650 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1238192650 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1238192650 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1238192650| ~y$r_buff1_thd0~0_In-1238192650) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1238192650|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1238192650, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1238192650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1238192650, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1238192650, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1238192650|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:02:54,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:02:54,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:02:54 BasicIcfg [2019-12-07 12:02:54,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:02:54,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:02:54,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:02:54,805 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:02:54,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:02:45" (3/4) ... [2019-12-07 12:02:54,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:02:54,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t307~0.base_27| 4) |v_#length_17|) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= |v_ULTIMATE.start_main_~#t307~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t307~0.base_27|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t307~0.base_27|)) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t307~0.base_27| 1) |v_#valid_61|) (= v_~main$tmp_guard1~0_47 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_27|) |v_ULTIMATE.start_main_~#t307~0.offset_19| 0)) |v_#memory_int_11|) (= v_~x~0_99 0) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_20|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ULTIMATE.start_main_~#t307~0.base=|v_ULTIMATE.start_main_~#t307~0.base_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ULTIMATE.start_main_~#t307~0.offset=|v_ULTIMATE.start_main_~#t307~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t308~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t307~0.base, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t308~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t307~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:02:54,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t308~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10|) |v_ULTIMATE.start_main_~#t308~0.offset_9| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t308~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t308~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t308~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t308~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t308~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:02:54,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In1607875120 ~__unbuffered_p0_EAX~0_Out1607875120) (= 1 ~y$r_buff0_thd1~0_Out1607875120) (= ~y$r_buff1_thd2~0_Out1607875120 ~y$r_buff0_thd2~0_In1607875120) (= ~y$r_buff0_thd0~0_In1607875120 ~y$r_buff1_thd0~0_Out1607875120) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1607875120)) (= ~y$r_buff1_thd1~0_Out1607875120 ~y$r_buff0_thd1~0_In1607875120)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1607875120, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1607875120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1607875120, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1607875120, ~x~0=~x~0_In1607875120} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1607875120, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1607875120, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1607875120, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1607875120, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1607875120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1607875120, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1607875120, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1607875120, ~x~0=~x~0_In1607875120} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:02:54,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1009192621 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1009192621 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1009192621| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1009192621| ~y$w_buff0_used~0_In-1009192621) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009192621, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009192621} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1009192621|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009192621, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009192621} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:02:54,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1059000688 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1059000688 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1059000688 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1059000688 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1059000688| ~y$w_buff1_used~0_In-1059000688) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1059000688| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1059000688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1059000688, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1059000688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1059000688} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1059000688|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1059000688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1059000688, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1059000688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1059000688} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:02:54,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In61331205 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out61331205 ~y$r_buff0_thd1~0_In61331205)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In61331205 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out61331205 0)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In61331205, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In61331205} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In61331205, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out61331205|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out61331205} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:02:54,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1508630165 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1508630165 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1508630165 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1508630165 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1508630165| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1508630165| ~y$r_buff1_thd1~0_In-1508630165) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1508630165|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:02:54,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:02:54,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-290504639 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-290504639| |P1Thread1of1ForFork1_#t~ite17_Out-290504639|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-290504639 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-290504639 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-290504639 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-290504639 256))))) .cse1 (= ~y$w_buff1~0_In-290504639 |P1Thread1of1ForFork1_#t~ite17_Out-290504639|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite17_In-290504639| |P1Thread1of1ForFork1_#t~ite17_Out-290504639|) (= |P1Thread1of1ForFork1_#t~ite18_Out-290504639| ~y$w_buff1~0_In-290504639)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-290504639, ~y$w_buff1~0=~y$w_buff1~0_In-290504639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-290504639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-290504639, ~weak$$choice2~0=~weak$$choice2~0_In-290504639, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-290504639|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290504639} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-290504639, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-290504639|, ~y$w_buff1~0=~y$w_buff1~0_In-290504639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-290504639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-290504639, ~weak$$choice2~0=~weak$$choice2~0_In-290504639, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-290504639|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-290504639} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:02:54,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-875969495 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-875969495| |P1Thread1of1ForFork1_#t~ite20_Out-875969495|) (= ~y$w_buff0_used~0_In-875969495 |P1Thread1of1ForFork1_#t~ite20_Out-875969495|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-875969495 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-875969495 256) 0)) (= (mod ~y$w_buff0_used~0_In-875969495 256) 0) (and (= (mod ~y$w_buff1_used~0_In-875969495 256) 0) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-875969495| |P1Thread1of1ForFork1_#t~ite20_Out-875969495|) (= |P1Thread1of1ForFork1_#t~ite21_Out-875969495| ~y$w_buff0_used~0_In-875969495)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-875969495, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-875969495, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-875969495|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-875969495, ~weak$$choice2~0=~weak$$choice2~0_In-875969495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-875969495} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-875969495, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-875969495, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-875969495|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-875969495, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-875969495|, ~weak$$choice2~0=~weak$$choice2~0_In-875969495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-875969495} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:02:54,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite24_Out-1245542242| |P1Thread1of1ForFork1_#t~ite23_Out-1245542242|)) (.cse4 (= (mod ~y$w_buff1_used~0_In-1245542242 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1245542242 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1245542242 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1245542242 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1245542242 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1245542242|) .cse2 (not .cse3) (or .cse1 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1245542242| |P1Thread1of1ForFork1_#t~ite22_Out-1245542242|) .cse5)) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1245542242| |P1Thread1of1ForFork1_#t~ite23_In-1245542242|) (= ~y$w_buff1_used~0_In-1245542242 |P1Thread1of1ForFork1_#t~ite24_Out-1245542242|) (not .cse5)) (and (= ~y$w_buff1_used~0_In-1245542242 |P1Thread1of1ForFork1_#t~ite23_Out-1245542242|) .cse2 (or (and .cse4 .cse6) (and .cse0 .cse6) .cse3) .cse5)) (= |P1Thread1of1ForFork1_#t~ite22_In-1245542242| |P1Thread1of1ForFork1_#t~ite22_Out-1245542242|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245542242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245542242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245542242, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1245542242|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1245542242|, ~weak$$choice2~0=~weak$$choice2~0_In-1245542242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245542242} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245542242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245542242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245542242, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1245542242|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1245542242|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1245542242|, ~weak$$choice2~0=~weak$$choice2~0_In-1245542242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245542242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 12:02:54,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:02:54,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1346447731 256) 0))) (or (let ((.cse0 (not (= (mod ~y$r_buff0_thd2~0_In1346447731 256) 0)))) (and (or (not (= 0 (mod ~y$r_buff1_thd2~0_In1346447731 256))) .cse0) .cse1 (or .cse0 (not (= (mod ~y$w_buff1_used~0_In1346447731 256) 0))) (= |P1Thread1of1ForFork1_#t~ite28_Out1346447731| |P1Thread1of1ForFork1_#t~ite29_Out1346447731|) (not (= 0 (mod ~y$w_buff0_used~0_In1346447731 256))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1346447731|) (= |P1Thread1of1ForFork1_#t~ite30_Out1346447731| |P1Thread1of1ForFork1_#t~ite29_Out1346447731|))) (and (= |P1Thread1of1ForFork1_#t~ite28_In1346447731| |P1Thread1of1ForFork1_#t~ite28_Out1346447731|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1346447731| |P1Thread1of1ForFork1_#t~ite29_Out1346447731|) (= ~y$r_buff1_thd2~0_In1346447731 |P1Thread1of1ForFork1_#t~ite30_Out1346447731|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1346447731, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1346447731|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1346447731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1346447731, ~weak$$choice2~0=~weak$$choice2~0_In1346447731, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1346447731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1346447731} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1346447731, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1346447731|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1346447731|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1346447731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1346447731, ~weak$$choice2~0=~weak$$choice2~0_In1346447731, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1346447731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1346447731} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:02:54,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:02:54,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-624327305 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-624327305| |P1Thread1of1ForFork1_#t~ite33_Out-624327305|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-624327305 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-624327305| ~y~0_In-624327305) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-624327305| ~y$w_buff1~0_In-624327305) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-624327305, ~y$w_buff1~0=~y$w_buff1~0_In-624327305, ~y~0=~y~0_In-624327305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-624327305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-624327305, ~y$w_buff1~0=~y$w_buff1~0_In-624327305, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-624327305|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-624327305|, ~y~0=~y~0_In-624327305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-624327305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 12:02:54,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In357285951 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In357285951 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out357285951| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out357285951| ~y$w_buff0_used~0_In357285951)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In357285951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In357285951} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In357285951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In357285951, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out357285951|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:02:54,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1379516204 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1379516204 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1379516204 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1379516204 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1379516204 |P1Thread1of1ForFork1_#t~ite35_Out1379516204|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1379516204| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379516204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379516204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379516204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379516204} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379516204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379516204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379516204, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1379516204|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379516204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:02:54,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In127354307 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In127354307 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out127354307|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In127354307 |P1Thread1of1ForFork1_#t~ite36_Out127354307|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In127354307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In127354307} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In127354307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In127354307, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out127354307|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:02:54,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In80807334 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In80807334 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In80807334 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In80807334 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out80807334|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In80807334 |P1Thread1of1ForFork1_#t~ite37_Out80807334|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In80807334, ~y$w_buff0_used~0=~y$w_buff0_used~0_In80807334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In80807334, ~y$w_buff1_used~0=~y$w_buff1_used~0_In80807334} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In80807334, ~y$w_buff0_used~0=~y$w_buff0_used~0_In80807334, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In80807334, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out80807334|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In80807334} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:02:54,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:02:54,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:02:54,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1428225286 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1428225286 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1428225286| ~y$w_buff1~0_In-1428225286) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1428225286| ~y~0_In-1428225286)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1428225286, ~y~0=~y~0_In-1428225286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1428225286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1428225286} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1428225286|, ~y$w_buff1~0=~y$w_buff1~0_In-1428225286, ~y~0=~y~0_In-1428225286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1428225286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1428225286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:02:54,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 12:02:54,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In31263795 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In31263795 256)))) (or (and (= ~y$w_buff0_used~0_In31263795 |ULTIMATE.start_main_#t~ite42_Out31263795|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out31263795|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In31263795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In31263795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In31263795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In31263795, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out31263795|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:02:54,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In304116532 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In304116532 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In304116532 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In304116532 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out304116532|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In304116532 |ULTIMATE.start_main_#t~ite43_Out304116532|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In304116532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In304116532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In304116532} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In304116532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out304116532|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In304116532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In304116532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:02:54,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-734442685 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-734442685 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-734442685|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-734442685 |ULTIMATE.start_main_#t~ite44_Out-734442685|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-734442685, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-734442685} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-734442685, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-734442685, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-734442685|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:02:54,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1238192650 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1238192650 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1238192650 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1238192650 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1238192650| ~y$r_buff1_thd0~0_In-1238192650) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1238192650|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1238192650, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1238192650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1238192650, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1238192650, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1238192650|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:02:54,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:02:54,860 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_89f1e424-c9c0-4bcf-876e-d5c6ca4e7d38/bin/utaipan/witness.graphml [2019-12-07 12:02:54,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:02:54,861 INFO L168 Benchmark]: Toolchain (without parser) took 9835.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 934.0 MB in the beginning and 871.4 MB in the end (delta: 62.6 MB). Peak memory consumption was 378.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:54,861 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:02:54,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:54,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.09 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 12:02:54,862 INFO L168 Benchmark]: Boogie Preprocessor took 27.81 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 12:02:54,862 INFO L168 Benchmark]: RCFGBuilder took 386.09 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:54,863 INFO L168 Benchmark]: TraceAbstraction took 8959.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 1.0 GB in the beginning and 894.5 MB in the end (delta: 110.0 MB). Peak memory consumption was 333.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:54,863 INFO L168 Benchmark]: Witness Printer took 55.61 ms. Allocated memory is still 1.3 GB. Free memory was 894.5 MB in the beginning and 871.4 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:02:54,864 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.09 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 27.81 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 386.09 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8959.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 1.0 GB in the beginning and 894.5 MB in the end (delta: 110.0 MB). Peak memory consumption was 333.9 MB. Max. memory is 11.5 GB. * Witness Printer took 55.61 ms. Allocated memory is still 1.3 GB. Free memory was 894.5 MB in the beginning and 871.4 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t308, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1878 SDtfs, 2147 SDslu, 4696 SDs, 0 SdLazy, 3687 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 24 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred 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.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 3553 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 139226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...