./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.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_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/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 27e4d41332fdc7e29d27690e9cf4b43965d7312b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:19:29,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:19:29,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:19:29,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:19:29,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:19:29,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:19:29,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:19:29,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:19:29,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:19:29,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:19:29,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:19:29,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:19:29,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:19:29,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:19:29,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:19:29,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:19:29,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:19:29,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:19:29,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:19:29,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:19:29,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:19:29,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:19:29,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:19:29,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:19:29,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:19:29,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:19:29,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:19:29,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:19:29,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:19:29,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:19:29,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:19:29,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:19:29,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:19:29,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:19:29,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:19:29,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:19:29,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:19:29,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:19:29,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:19:29,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:19:29,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:19:29,442 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:19:29,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:19:29,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:19:29,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:19:29,457 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:19:29,457 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:19:29,457 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:19:29,457 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:19:29,457 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:19:29,458 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:19:29,458 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:19:29,458 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:19:29,458 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:19:29,458 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:19:29,459 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:19:29,459 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:19:29,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:19:29,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:19:29,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:19:29,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:19:29,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:19:29,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:19:29,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:19:29,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:19:29,461 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:19:29,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:19:29,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:19:29,461 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:19:29,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:19:29,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:19:29,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:19:29,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:19:29,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:19:29,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:19:29,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:19:29,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:19:29,463 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:19:29,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:19:29,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:19:29,464 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:19:29,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:19:29,464 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_0d4295f3-83cd-4425-8612-817ff2bb5a2f/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 -> 27e4d41332fdc7e29d27690e9cf4b43965d7312b [2019-12-07 20:19:29,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:19:29,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:19:29,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:19:29,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:19:29,591 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:19:29,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.i [2019-12-07 20:19:29,637 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/data/9cf23505c/b936eebb8e7e40c9ae3edf671ee540de/FLAG030fab678 [2019-12-07 20:19:30,051 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:19:30,051 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc.i [2019-12-07 20:19:30,061 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/data/9cf23505c/b936eebb8e7e40c9ae3edf671ee540de/FLAG030fab678 [2019-12-07 20:19:30,423 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/data/9cf23505c/b936eebb8e7e40c9ae3edf671ee540de [2019-12-07 20:19:30,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:19:30,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:19:30,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:19:30,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:19:30,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:19:30,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c827a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30, skipping insertion in model container [2019-12-07 20:19:30,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:19:30,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:19:30,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:19:30,736 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:19:30,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:19:30,820 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:19:30,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30 WrapperNode [2019-12-07 20:19:30,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:19:30,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:19:30,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:19:30,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:19:30,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:19:30,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:19:30,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:19:30,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:19:30,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... [2019-12-07 20:19:30,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:19:30,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:19:30,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:19:30,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:19:30,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/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 20:19:30,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:19:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:19:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:19:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:19:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:19:30,924 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 20:19:31,266 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:19:31,266 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:19:31,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:31 BoogieIcfgContainer [2019-12-07 20:19:31,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:19:31,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:19:31,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:19:31,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:19:31,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:19:30" (1/3) ... [2019-12-07 20:19:31,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138add0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:19:31, skipping insertion in model container [2019-12-07 20:19:31,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:19:30" (2/3) ... [2019-12-07 20:19:31,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138add0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:19:31, skipping insertion in model container [2019-12-07 20:19:31,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:31" (3/3) ... [2019-12-07 20:19:31,271 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc.i [2019-12-07 20:19:31,277 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:19:31,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:19:31,282 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:19:31,282 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:19:31,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:19:31,332 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 20:19:31,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:19:31,345 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:19:31,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:19:31,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:19:31,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:19:31,345 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:19:31,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:19:31,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:19:31,355 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 20:19:31,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 20:19:31,403 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 20:19:31,403 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:19:31,411 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 20:19:31,423 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 20:19:31,447 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 20:19:31,447 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:19:31,451 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 20:19:31,461 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 20:19:31,461 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:19:34,197 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 20:19:34,441 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-07 20:19:34,441 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 20:19:34,443 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 20:19:34,794 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-07 20:19:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-07 20:19:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:19:34,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:34,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:19:34,800 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-07 20:19:34,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:34,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18906280] [2019-12-07 20:19:34,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:34,942 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 20:19:34,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18906280] [2019-12-07 20:19:34,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:34,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:19:34,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032737214] [2019-12-07 20:19:34,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:34,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:34,957 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-07 20:19:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:35,120 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-07 20:19:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:35,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:19:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:35,177 INFO L225 Difference]: With dead ends: 8760 [2019-12-07 20:19:35,177 INFO L226 Difference]: Without dead ends: 7798 [2019-12-07 20:19:35,178 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 20:19:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-07 20:19:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-07 20:19:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-07 20:19:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-07 20:19:35,443 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-07 20:19:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:35,443 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-07 20:19:35,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-07 20:19:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:19:35,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:35,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:35,446 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:35,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-07 20:19:35,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:35,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247390613] [2019-12-07 20:19:35,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:35,494 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 20:19:35,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247390613] [2019-12-07 20:19:35,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:35,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:35,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715466711] [2019-12-07 20:19:35,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:35,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:35,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:35,496 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-07 20:19:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:35,515 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-07 20:19:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:35,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 20:19:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:35,521 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 20:19:35,521 INFO L226 Difference]: Without dead ends: 1232 [2019-12-07 20:19:35,521 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 20:19:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-07 20:19:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-07 20:19:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-07 20:19:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-07 20:19:35,542 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-07 20:19:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:35,578 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-07 20:19:35,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-07 20:19:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:19:35,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:35,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:35,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-07 20:19:35,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:35,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419335545] [2019-12-07 20:19:35,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:35,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419335545] [2019-12-07 20:19:35,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:35,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:35,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836435450] [2019-12-07 20:19:35,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:35,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:35,668 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-07 20:19:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:35,879 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-07 20:19:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:19:35,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 20:19:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:35,887 INFO L225 Difference]: With dead ends: 1829 [2019-12-07 20:19:35,887 INFO L226 Difference]: Without dead ends: 1829 [2019-12-07 20:19:35,887 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 20:19:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-07 20:19:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-07 20:19:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-07 20:19:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-07 20:19:35,921 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-07 20:19:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:35,921 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-07 20:19:35,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-07 20:19:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:19:35,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:35,924 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 20:19:35,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-07 20:19:35,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:35,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846225511] [2019-12-07 20:19:35,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:36,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846225511] [2019-12-07 20:19:36,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:36,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:36,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911258662] [2019-12-07 20:19:36,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:36,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:36,007 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-07 20:19:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:36,271 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-07 20:19:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:19:36,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 20:19:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:36,281 INFO L225 Difference]: With dead ends: 2337 [2019-12-07 20:19:36,281 INFO L226 Difference]: Without dead ends: 2337 [2019-12-07 20:19:36,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:19:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-07 20:19:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-07 20:19:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-07 20:19:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-07 20:19:36,310 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-07 20:19:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:36,310 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-07 20:19:36,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-07 20:19:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:19:36,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:36,312 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 20:19:36,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:36,312 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-07 20:19:36,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:36,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449070294] [2019-12-07 20:19:36,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:36,366 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 20:19:36,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449070294] [2019-12-07 20:19:36,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:36,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:36,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338067502] [2019-12-07 20:19:36,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:36,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:36,368 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-12-07 20:19:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:36,658 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-12-07 20:19:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:19:36,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 20:19:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:36,668 INFO L225 Difference]: With dead ends: 2417 [2019-12-07 20:19:36,669 INFO L226 Difference]: Without dead ends: 2417 [2019-12-07 20:19:36,669 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 20:19:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-12-07 20:19:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-12-07 20:19:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-12-07 20:19:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-12-07 20:19:36,708 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-12-07 20:19:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:36,709 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-12-07 20:19:36,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-12-07 20:19:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:19:36,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:36,711 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 20:19:36,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-12-07 20:19:36,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:36,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113521545] [2019-12-07 20:19:36,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:36,756 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 20:19:36,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113521545] [2019-12-07 20:19:36,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:36,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:36,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048991882] [2019-12-07 20:19:36,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:36,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:36,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:36,758 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-12-07 20:19:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:36,768 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-12-07 20:19:36,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:36,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 20:19:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:36,774 INFO L225 Difference]: With dead ends: 1195 [2019-12-07 20:19:36,774 INFO L226 Difference]: Without dead ends: 1195 [2019-12-07 20:19:36,774 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 20:19:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-12-07 20:19:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-12-07 20:19:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-07 20:19:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-12-07 20:19:36,789 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 27 [2019-12-07 20:19:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:36,789 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-12-07 20:19:36,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-12-07 20:19:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 20:19:36,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:36,792 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 20:19:36,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:36,792 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-12-07 20:19:36,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:36,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41758606] [2019-12-07 20:19:36,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:36,875 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 20:19:36,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41758606] [2019-12-07 20:19:36,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:36,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:19:36,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582206847] [2019-12-07 20:19:36,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:19:36,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:19:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:36,876 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-12-07 20:19:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:37,350 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-12-07 20:19:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:19:37,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 20:19:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:37,358 INFO L225 Difference]: With dead ends: 1596 [2019-12-07 20:19:37,358 INFO L226 Difference]: Without dead ends: 1590 [2019-12-07 20:19:37,358 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 20:19:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-07 20:19:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-12-07 20:19:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-12-07 20:19:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-12-07 20:19:37,378 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-12-07 20:19:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:37,378 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-12-07 20:19:37,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:19:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-12-07 20:19:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 20:19:37,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:37,402 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 20:19:37,402 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-12-07 20:19:37,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:37,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542080929] [2019-12-07 20:19:37,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:37,450 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 20:19:37,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542080929] [2019-12-07 20:19:37,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:37,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:37,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206864769] [2019-12-07 20:19:37,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:37,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:37,451 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-12-07 20:19:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:37,489 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-12-07 20:19:37,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:37,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 20:19:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:37,494 INFO L225 Difference]: With dead ends: 1575 [2019-12-07 20:19:37,494 INFO L226 Difference]: Without dead ends: 1575 [2019-12-07 20:19:37,494 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 20:19:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-12-07 20:19:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-12-07 20:19:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-07 20:19:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-12-07 20:19:37,509 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-12-07 20:19:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:37,510 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-12-07 20:19:37,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-12-07 20:19:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 20:19:37,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:37,512 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 20:19:37,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-12-07 20:19:37,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:37,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586456150] [2019-12-07 20:19:37,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:37,659 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 20:19:37,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586456150] [2019-12-07 20:19:37,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:37,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 20:19:37,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47372191] [2019-12-07 20:19:37,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:19:37,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:19:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:19:37,661 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 10 states. [2019-12-07 20:19:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:38,358 INFO L93 Difference]: Finished difference Result 1987 states and 4096 transitions. [2019-12-07 20:19:38,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 20:19:38,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-07 20:19:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:38,362 INFO L225 Difference]: With dead ends: 1987 [2019-12-07 20:19:38,362 INFO L226 Difference]: Without dead ends: 1987 [2019-12-07 20:19:38,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:19:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-12-07 20:19:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1323. [2019-12-07 20:19:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-12-07 20:19:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2817 transitions. [2019-12-07 20:19:38,385 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2817 transitions. Word has length 51 [2019-12-07 20:19:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:38,385 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 2817 transitions. [2019-12-07 20:19:38,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:19:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2817 transitions. [2019-12-07 20:19:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 20:19:38,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:38,388 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 20:19:38,388 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:38,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-12-07 20:19:38,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:38,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795500116] [2019-12-07 20:19:38,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:38,450 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 20:19:38,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795500116] [2019-12-07 20:19:38,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:38,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:38,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442401218] [2019-12-07 20:19:38,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:38,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:38,451 INFO L87 Difference]: Start difference. First operand 1323 states and 2817 transitions. Second operand 4 states. [2019-12-07 20:19:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:38,465 INFO L93 Difference]: Finished difference Result 2216 states and 4731 transitions. [2019-12-07 20:19:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:38,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 20:19:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:38,467 INFO L225 Difference]: With dead ends: 2216 [2019-12-07 20:19:38,467 INFO L226 Difference]: Without dead ends: 962 [2019-12-07 20:19:38,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-12-07 20:19:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-12-07 20:19:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-07 20:19:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2044 transitions. [2019-12-07 20:19:38,478 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2044 transitions. Word has length 51 [2019-12-07 20:19:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:38,478 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2044 transitions. [2019-12-07 20:19:38,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2044 transitions. [2019-12-07 20:19:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 20:19:38,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:38,480 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 20:19:38,480 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2033347596, now seen corresponding path program 3 times [2019-12-07 20:19:38,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:38,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931397058] [2019-12-07 20:19:38,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:38,521 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 20:19:38,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931397058] [2019-12-07 20:19:38,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:38,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:38,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329668234] [2019-12-07 20:19:38,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:38,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:38,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:38,523 INFO L87 Difference]: Start difference. First operand 962 states and 2044 transitions. Second operand 3 states. [2019-12-07 20:19:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:38,533 INFO L93 Difference]: Finished difference Result 961 states and 2042 transitions. [2019-12-07 20:19:38,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:38,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 20:19:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:38,534 INFO L225 Difference]: With dead ends: 961 [2019-12-07 20:19:38,535 INFO L226 Difference]: Without dead ends: 961 [2019-12-07 20:19:38,535 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 20:19:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-12-07 20:19:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 795. [2019-12-07 20:19:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-07 20:19:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-12-07 20:19:38,544 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 51 [2019-12-07 20:19:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:38,545 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-12-07 20:19:38,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-12-07 20:19:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:19:38,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:38,546 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 20:19:38,546 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:38,546 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 1 times [2019-12-07 20:19:38,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:38,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334671683] [2019-12-07 20:19:38,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:38,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334671683] [2019-12-07 20:19:38,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:38,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:19:38,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361167387] [2019-12-07 20:19:38,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:19:38,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:19:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:38,621 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 7 states. [2019-12-07 20:19:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:38,749 INFO L93 Difference]: Finished difference Result 1395 states and 2928 transitions. [2019-12-07 20:19:38,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:19:38,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 20:19:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:38,751 INFO L225 Difference]: With dead ends: 1395 [2019-12-07 20:19:38,751 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 20:19:38,752 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 20:19:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 20:19:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-12-07 20:19:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 20:19:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-07 20:19:38,766 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 52 [2019-12-07 20:19:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:38,766 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-07 20:19:38,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:19:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-07 20:19:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:19:38,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:38,768 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 20:19:38,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 2 times [2019-12-07 20:19:38,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:38,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086560979] [2019-12-07 20:19:38,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:38,845 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:19:38,845 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:19:38,848 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) (= v_~y$r_buff0_thd0~0_150 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t313~0.base_27|) (= 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) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t313~0.base_27| 1) |v_#valid_61|) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t313~0.base_27|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_27|) |v_ULTIMATE.start_main_~#t313~0.offset_19| 0)) |v_#memory_int_11|) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= 0 |v_ULTIMATE.start_main_~#t313~0.offset_19|) (= v_~x~0_99 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t313~0.base_27| 4)) (= 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{ULTIMATE.start_main_~#t313~0.base=|v_ULTIMATE.start_main_~#t313~0.base_27|, ~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, #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, ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_20|, ~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, ~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|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_28|, ~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_#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|, ULTIMATE.start_main_~#t313~0.offset=|v_ULTIMATE.start_main_~#t313~0.offset_19|, ~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, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t313~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #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, ULTIMATE.start_main_~#t314~0.offset, ~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, ~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, ULTIMATE.start_main_~#t314~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t313~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:19:38,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t314~0.offset_9| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t314~0.base_10| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t314~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10|) 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10|) |v_ULTIMATE.start_main_~#t314~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t314~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t314~0.offset, ULTIMATE.start_main_~#t314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 20:19:38,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In105941989 0)) (= ~y$r_buff0_thd2~0_In105941989 ~y$r_buff1_thd2~0_Out105941989) (= ~x~0_In105941989 ~__unbuffered_p0_EAX~0_Out105941989) (= ~y$r_buff0_thd1~0_In105941989 ~y$r_buff1_thd1~0_Out105941989) (= ~y$r_buff0_thd0~0_In105941989 ~y$r_buff1_thd0~0_Out105941989) (= 1 ~y$r_buff0_thd1~0_Out105941989)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In105941989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In105941989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In105941989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In105941989, ~x~0=~x~0_In105941989} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out105941989, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out105941989, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out105941989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In105941989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out105941989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In105941989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In105941989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out105941989, ~x~0=~x~0_In105941989} 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 20:19:38,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2141693172 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2141693172 256)))) (or (and (= ~y$w_buff0_used~0_In-2141693172 |P0Thread1of1ForFork0_#t~ite5_Out-2141693172|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2141693172|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141693172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2141693172} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2141693172|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141693172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2141693172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:19:38,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In2007012762 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2007012762 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2007012762 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In2007012762 256) 0))) (or (and (= ~y$w_buff1_used~0_In2007012762 |P0Thread1of1ForFork0_#t~ite6_Out2007012762|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out2007012762| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2007012762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2007012762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2007012762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2007012762} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2007012762|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2007012762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2007012762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2007012762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2007012762} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:19:38,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-2091703092 ~y$r_buff0_thd1~0_Out-2091703092)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2091703092 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2091703092 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-2091703092)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2091703092, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2091703092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2091703092, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2091703092|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2091703092} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:19:38,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-995683682 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-995683682 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-995683682 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-995683682 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-995683682 |P0Thread1of1ForFork0_#t~ite8_Out-995683682|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-995683682|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-995683682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-995683682, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-995683682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-995683682} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-995683682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-995683682, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-995683682|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-995683682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-995683682} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:19:38,851 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 20:19:38,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1472681744 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1472681744| ~y$w_buff1~0_In1472681744) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1472681744| |P1Thread1of1ForFork1_#t~ite17_Out1472681744|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1472681744| ~y$w_buff1~0_In1472681744) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1472681744 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1472681744 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1472681744 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1472681744 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out1472681744| |P1Thread1of1ForFork1_#t~ite18_Out1472681744|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1472681744, ~y$w_buff1~0=~y$w_buff1~0_In1472681744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1472681744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1472681744, ~weak$$choice2~0=~weak$$choice2~0_In1472681744, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1472681744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1472681744} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1472681744, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1472681744|, ~y$w_buff1~0=~y$w_buff1~0_In1472681744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1472681744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1472681744, ~weak$$choice2~0=~weak$$choice2~0_In1472681744, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1472681744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1472681744} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 20:19:38,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1080596695 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1080596695| |P1Thread1of1ForFork1_#t~ite20_Out-1080596695|) (not .cse0) (= ~y$w_buff0_used~0_In-1080596695 |P1Thread1of1ForFork1_#t~ite21_Out-1080596695|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1080596695 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1080596695 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1080596695 256))) (and (= (mod ~y$r_buff1_thd2~0_In-1080596695 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1080596695| |P1Thread1of1ForFork1_#t~ite20_Out-1080596695|) (= ~y$w_buff0_used~0_In-1080596695 |P1Thread1of1ForFork1_#t~ite20_Out-1080596695|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1080596695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080596695, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1080596695|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080596695, ~weak$$choice2~0=~weak$$choice2~0_In-1080596695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1080596695} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1080596695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080596695, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1080596695|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080596695, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1080596695|, ~weak$$choice2~0=~weak$$choice2~0_In-1080596695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1080596695} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:19:38,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1211482251 256))) (.cse4 (= (mod ~weak$$choice2~0_In1211482251 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| |P1Thread1of1ForFork1_#t~ite24_Out1211482251|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1211482251 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1211482251 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1211482251 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In1211482251| |P1Thread1of1ForFork1_#t~ite22_Out1211482251|) (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| ~y$w_buff1_used~0_In1211482251) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| |P1Thread1of1ForFork1_#t~ite23_In1211482251|) (= |P1Thread1of1ForFork1_#t~ite24_Out1211482251| ~y$w_buff1_used~0_In1211482251) (not .cse4)))) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| |P1Thread1of1ForFork1_#t~ite22_Out1211482251|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1211482251|) (not .cse0) .cse4 .cse5 (or (not .cse2) .cse6) (or .cse6 (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1211482251, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1211482251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1211482251, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1211482251|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1211482251|, ~weak$$choice2~0=~weak$$choice2~0_In1211482251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1211482251} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1211482251, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1211482251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1211482251, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1211482251|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1211482251|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1211482251|, ~weak$$choice2~0=~weak$$choice2~0_In1211482251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1211482251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 20:19:38,873 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 20:19:38,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In232557546 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In232557546| |P1Thread1of1ForFork1_#t~ite28_Out232557546|) (= |P1Thread1of1ForFork1_#t~ite30_Out232557546| ~y$r_buff1_thd2~0_In232557546) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In232557546| |P1Thread1of1ForFork1_#t~ite29_Out232557546|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In232557546 256))))) (and (or (not (= 0 (mod ~y$w_buff1_used~0_In232557546 256))) .cse1) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In232557546 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out232557546| |P1Thread1of1ForFork1_#t~ite28_Out232557546|) (not (= 0 (mod ~y$w_buff0_used~0_In232557546 256))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out232557546|) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out232557546| |P1Thread1of1ForFork1_#t~ite29_Out232557546|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In232557546, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In232557546|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In232557546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In232557546, ~weak$$choice2~0=~weak$$choice2~0_In232557546, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In232557546|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In232557546} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In232557546, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out232557546|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out232557546|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In232557546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In232557546, ~weak$$choice2~0=~weak$$choice2~0_In232557546, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out232557546|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In232557546} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 20:19:38,874 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 20:19:38,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1237598497 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1237598497 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-1237598497| |P1Thread1of1ForFork1_#t~ite32_Out-1237598497|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1237598497| ~y$w_buff1~0_In-1237598497) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1237598497| ~y~0_In-1237598497) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1237598497, ~y$w_buff1~0=~y$w_buff1~0_In-1237598497, ~y~0=~y~0_In-1237598497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1237598497} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1237598497, ~y$w_buff1~0=~y$w_buff1~0_In-1237598497, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1237598497|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1237598497|, ~y~0=~y~0_In-1237598497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1237598497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 20:19:38,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1334552618 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1334552618 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1334552618| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1334552618| ~y$w_buff0_used~0_In1334552618)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1334552618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334552618} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1334552618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334552618, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1334552618|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 20:19:38,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-643274409 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-643274409 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-643274409 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-643274409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-643274409|)) (and (= ~y$w_buff1_used~0_In-643274409 |P1Thread1of1ForFork1_#t~ite35_Out-643274409|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-643274409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-643274409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-643274409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-643274409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-643274409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-643274409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-643274409, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-643274409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-643274409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 20:19:38,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1280741874 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1280741874 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1280741874|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1280741874 |P1Thread1of1ForFork1_#t~ite36_Out1280741874|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1280741874, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280741874} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1280741874, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280741874, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1280741874|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 20:19:38,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-860058277 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-860058277 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-860058277 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-860058277 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-860058277 |P1Thread1of1ForFork1_#t~ite37_Out-860058277|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-860058277|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-860058277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-860058277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-860058277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860058277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-860058277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-860058277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-860058277, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-860058277|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860058277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:19:38,877 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 20:19:38,877 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 20:19:38,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1327573360 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1327573360 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1327573360| ~y$w_buff1~0_In-1327573360) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1327573360| ~y~0_In-1327573360)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1327573360, ~y~0=~y~0_In-1327573360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1327573360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1327573360} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1327573360|, ~y$w_buff1~0=~y$w_buff1~0_In-1327573360, ~y~0=~y~0_In-1327573360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1327573360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1327573360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:19:38,877 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 20:19:38,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-765368764 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-765368764 256) 0))) (or (and (= ~y$w_buff0_used~0_In-765368764 |ULTIMATE.start_main_#t~ite42_Out-765368764|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-765368764|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-765368764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-765368764} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-765368764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-765368764, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-765368764|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:19:38,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-841825758 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-841825758 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-841825758 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-841825758 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-841825758|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-841825758 |ULTIMATE.start_main_#t~ite43_Out-841825758|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-841825758, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841825758, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-841825758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-841825758} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-841825758, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841825758, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-841825758|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-841825758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-841825758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 20:19:38,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-451481392 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-451481392 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-451481392| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-451481392| ~y$r_buff0_thd0~0_In-451481392)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-451481392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-451481392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-451481392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-451481392, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-451481392|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:19:38,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-236428158 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-236428158 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-236428158 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-236428158 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-236428158|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-236428158| ~y$r_buff1_thd0~0_In-236428158)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-236428158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-236428158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-236428158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-236428158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-236428158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-236428158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-236428158, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-236428158|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-236428158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 20:19:38,879 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 20:19:38,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:19:38 BasicIcfg [2019-12-07 20:19:38,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:19:38,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:19:38,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:19:38,929 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:19:38,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:19:31" (3/4) ... [2019-12-07 20:19:38,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:19:38,932 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) (= v_~y$r_buff0_thd0~0_150 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t313~0.base_27|) (= 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) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t313~0.base_27| 1) |v_#valid_61|) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t313~0.base_27|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_27|) |v_ULTIMATE.start_main_~#t313~0.offset_19| 0)) |v_#memory_int_11|) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= 0 |v_ULTIMATE.start_main_~#t313~0.offset_19|) (= v_~x~0_99 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t313~0.base_27| 4)) (= 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{ULTIMATE.start_main_~#t313~0.base=|v_ULTIMATE.start_main_~#t313~0.base_27|, ~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, #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, ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_20|, ~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, ~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|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_28|, ~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_#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|, ULTIMATE.start_main_~#t313~0.offset=|v_ULTIMATE.start_main_~#t313~0.offset_19|, ~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, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t313~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #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, ULTIMATE.start_main_~#t314~0.offset, ~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, ~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, ULTIMATE.start_main_~#t314~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t313~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:19:38,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t314~0.offset_9| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t314~0.base_10| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t314~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10|) 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10|) |v_ULTIMATE.start_main_~#t314~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t314~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t314~0.offset, ULTIMATE.start_main_~#t314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 20:19:38,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In105941989 0)) (= ~y$r_buff0_thd2~0_In105941989 ~y$r_buff1_thd2~0_Out105941989) (= ~x~0_In105941989 ~__unbuffered_p0_EAX~0_Out105941989) (= ~y$r_buff0_thd1~0_In105941989 ~y$r_buff1_thd1~0_Out105941989) (= ~y$r_buff0_thd0~0_In105941989 ~y$r_buff1_thd0~0_Out105941989) (= 1 ~y$r_buff0_thd1~0_Out105941989)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In105941989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In105941989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In105941989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In105941989, ~x~0=~x~0_In105941989} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out105941989, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out105941989, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out105941989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In105941989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out105941989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In105941989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In105941989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out105941989, ~x~0=~x~0_In105941989} 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 20:19:38,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2141693172 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2141693172 256)))) (or (and (= ~y$w_buff0_used~0_In-2141693172 |P0Thread1of1ForFork0_#t~ite5_Out-2141693172|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2141693172|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141693172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2141693172} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2141693172|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141693172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2141693172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:19:38,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In2007012762 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2007012762 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2007012762 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In2007012762 256) 0))) (or (and (= ~y$w_buff1_used~0_In2007012762 |P0Thread1of1ForFork0_#t~ite6_Out2007012762|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out2007012762| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2007012762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2007012762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2007012762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2007012762} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2007012762|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2007012762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2007012762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2007012762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2007012762} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:19:38,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-2091703092 ~y$r_buff0_thd1~0_Out-2091703092)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2091703092 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2091703092 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-2091703092)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2091703092, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2091703092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2091703092, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2091703092|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2091703092} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:19:38,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-995683682 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-995683682 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-995683682 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-995683682 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-995683682 |P0Thread1of1ForFork0_#t~ite8_Out-995683682|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-995683682|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-995683682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-995683682, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-995683682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-995683682} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-995683682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-995683682, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-995683682|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-995683682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-995683682} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:19:38,935 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 20:19:38,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1472681744 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1472681744| ~y$w_buff1~0_In1472681744) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1472681744| |P1Thread1of1ForFork1_#t~ite17_Out1472681744|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1472681744| ~y$w_buff1~0_In1472681744) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1472681744 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1472681744 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1472681744 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1472681744 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out1472681744| |P1Thread1of1ForFork1_#t~ite18_Out1472681744|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1472681744, ~y$w_buff1~0=~y$w_buff1~0_In1472681744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1472681744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1472681744, ~weak$$choice2~0=~weak$$choice2~0_In1472681744, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1472681744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1472681744} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1472681744, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1472681744|, ~y$w_buff1~0=~y$w_buff1~0_In1472681744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1472681744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1472681744, ~weak$$choice2~0=~weak$$choice2~0_In1472681744, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1472681744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1472681744} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 20:19:38,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1080596695 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1080596695| |P1Thread1of1ForFork1_#t~ite20_Out-1080596695|) (not .cse0) (= ~y$w_buff0_used~0_In-1080596695 |P1Thread1of1ForFork1_#t~ite21_Out-1080596695|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1080596695 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1080596695 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1080596695 256))) (and (= (mod ~y$r_buff1_thd2~0_In-1080596695 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1080596695| |P1Thread1of1ForFork1_#t~ite20_Out-1080596695|) (= ~y$w_buff0_used~0_In-1080596695 |P1Thread1of1ForFork1_#t~ite20_Out-1080596695|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1080596695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080596695, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1080596695|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080596695, ~weak$$choice2~0=~weak$$choice2~0_In-1080596695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1080596695} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1080596695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1080596695, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1080596695|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1080596695, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1080596695|, ~weak$$choice2~0=~weak$$choice2~0_In-1080596695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1080596695} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:19:38,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1211482251 256))) (.cse4 (= (mod ~weak$$choice2~0_In1211482251 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| |P1Thread1of1ForFork1_#t~ite24_Out1211482251|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1211482251 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1211482251 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1211482251 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In1211482251| |P1Thread1of1ForFork1_#t~ite22_Out1211482251|) (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| ~y$w_buff1_used~0_In1211482251) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| |P1Thread1of1ForFork1_#t~ite23_In1211482251|) (= |P1Thread1of1ForFork1_#t~ite24_Out1211482251| ~y$w_buff1_used~0_In1211482251) (not .cse4)))) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1211482251| |P1Thread1of1ForFork1_#t~ite22_Out1211482251|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1211482251|) (not .cse0) .cse4 .cse5 (or (not .cse2) .cse6) (or .cse6 (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1211482251, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1211482251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1211482251, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1211482251|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1211482251|, ~weak$$choice2~0=~weak$$choice2~0_In1211482251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1211482251} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1211482251, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1211482251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1211482251, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1211482251|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1211482251|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1211482251|, ~weak$$choice2~0=~weak$$choice2~0_In1211482251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1211482251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 20:19:38,936 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 20:19:38,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In232557546 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In232557546| |P1Thread1of1ForFork1_#t~ite28_Out232557546|) (= |P1Thread1of1ForFork1_#t~ite30_Out232557546| ~y$r_buff1_thd2~0_In232557546) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In232557546| |P1Thread1of1ForFork1_#t~ite29_Out232557546|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In232557546 256))))) (and (or (not (= 0 (mod ~y$w_buff1_used~0_In232557546 256))) .cse1) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In232557546 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out232557546| |P1Thread1of1ForFork1_#t~ite28_Out232557546|) (not (= 0 (mod ~y$w_buff0_used~0_In232557546 256))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out232557546|) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out232557546| |P1Thread1of1ForFork1_#t~ite29_Out232557546|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In232557546, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In232557546|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In232557546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In232557546, ~weak$$choice2~0=~weak$$choice2~0_In232557546, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In232557546|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In232557546} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In232557546, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out232557546|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out232557546|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In232557546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In232557546, ~weak$$choice2~0=~weak$$choice2~0_In232557546, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out232557546|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In232557546} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 20:19:38,936 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 20:19:38,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1237598497 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1237598497 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-1237598497| |P1Thread1of1ForFork1_#t~ite32_Out-1237598497|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1237598497| ~y$w_buff1~0_In-1237598497) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1237598497| ~y~0_In-1237598497) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1237598497, ~y$w_buff1~0=~y$w_buff1~0_In-1237598497, ~y~0=~y~0_In-1237598497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1237598497} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1237598497, ~y$w_buff1~0=~y$w_buff1~0_In-1237598497, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1237598497|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1237598497|, ~y~0=~y~0_In-1237598497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1237598497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 20:19:38,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1334552618 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1334552618 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1334552618| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1334552618| ~y$w_buff0_used~0_In1334552618)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1334552618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334552618} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1334552618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1334552618, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1334552618|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 20:19:38,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-643274409 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-643274409 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-643274409 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-643274409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-643274409|)) (and (= ~y$w_buff1_used~0_In-643274409 |P1Thread1of1ForFork1_#t~ite35_Out-643274409|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-643274409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-643274409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-643274409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-643274409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-643274409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-643274409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-643274409, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-643274409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-643274409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 20:19:38,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1280741874 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1280741874 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1280741874|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1280741874 |P1Thread1of1ForFork1_#t~ite36_Out1280741874|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1280741874, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280741874} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1280741874, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280741874, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1280741874|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 20:19:38,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-860058277 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-860058277 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-860058277 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-860058277 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-860058277 |P1Thread1of1ForFork1_#t~ite37_Out-860058277|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-860058277|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-860058277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-860058277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-860058277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860058277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-860058277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-860058277, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-860058277, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-860058277|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860058277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:19:38,938 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 20:19:38,938 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 20:19:38,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1327573360 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1327573360 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1327573360| ~y$w_buff1~0_In-1327573360) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1327573360| ~y~0_In-1327573360)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1327573360, ~y~0=~y~0_In-1327573360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1327573360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1327573360} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1327573360|, ~y$w_buff1~0=~y$w_buff1~0_In-1327573360, ~y~0=~y~0_In-1327573360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1327573360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1327573360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:19:38,938 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 20:19:38,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-765368764 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-765368764 256) 0))) (or (and (= ~y$w_buff0_used~0_In-765368764 |ULTIMATE.start_main_#t~ite42_Out-765368764|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-765368764|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-765368764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-765368764} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-765368764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-765368764, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-765368764|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:19:38,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-841825758 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-841825758 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-841825758 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-841825758 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-841825758|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-841825758 |ULTIMATE.start_main_#t~ite43_Out-841825758|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-841825758, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841825758, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-841825758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-841825758} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-841825758, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-841825758, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-841825758|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-841825758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-841825758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 20:19:38,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-451481392 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-451481392 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-451481392| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-451481392| ~y$r_buff0_thd0~0_In-451481392)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-451481392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-451481392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-451481392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-451481392, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-451481392|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:19:38,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-236428158 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-236428158 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-236428158 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-236428158 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-236428158|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-236428158| ~y$r_buff1_thd0~0_In-236428158)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-236428158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-236428158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-236428158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-236428158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-236428158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-236428158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-236428158, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-236428158|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-236428158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 20:19:38,939 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 20:19:38,997 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0d4295f3-83cd-4425-8612-817ff2bb5a2f/bin/utaipan/witness.graphml [2019-12-07 20:19:38,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:19:38,998 INFO L168 Benchmark]: Toolchain (without parser) took 8569.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.9 MB). Free memory was 944.6 MB in the beginning and 1.3 GB in the end (delta: -344.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:38,999 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:19:38,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:39,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.06 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:39,000 INFO L168 Benchmark]: Boogie Preprocessor took 23.04 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:39,000 INFO L168 Benchmark]: RCFGBuilder took 386.60 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: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:39,001 INFO L168 Benchmark]: TraceAbstraction took 7660.94 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -294.4 MB). Peak memory consumption was 350.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:39,001 INFO L168 Benchmark]: Witness Printer took 68.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:39,004 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 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.06 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.04 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.60 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: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7660.94 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -294.4 MB). Peak memory consumption was 350.5 MB. Max. memory is 11.5 GB. * Witness Printer took 68.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 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(&t313, ((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(&t314, ((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: 7.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1486 SDtfs, 1509 SDslu, 3102 SDs, 0 SdLazy, 2646 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 20 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s 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.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 3053 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 70322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...