./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/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 711257b3ee0c9d02c2ed443d9c0f84975558d4c1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:23:52,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:23:52,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:23:52,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:23:52,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:23:52,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:23:52,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:23:52,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:23:52,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:23:52,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:23:52,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:23:52,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:23:52,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:23:52,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:23:52,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:23:52,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:23:52,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:23:52,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:23:52,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:23:52,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:23:52,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:23:52,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:23:52,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:23:52,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:23:52,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:23:52,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:23:52,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:23:52,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:23:52,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:23:52,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:23:52,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:23:52,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:23:52,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:23:52,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:23:52,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:23:52,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:23:52,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:23:52,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:23:52,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:23:52,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:23:52,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:23:52,395 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:23:52,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:23:52,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:23:52,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:23:52,407 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:23:52,407 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:23:52,407 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:23:52,407 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:23:52,408 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:23:52,408 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:23:52,408 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:23:52,408 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:23:52,408 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:23:52,408 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:23:52,408 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:23:52,409 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:23:52,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:23:52,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:23:52,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:23:52,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:23:52,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:23:52,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:23:52,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:23:52,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:23:52,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:23:52,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:23:52,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:23:52,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:23:52,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:23:52,412 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:23:52,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:23:52,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:23:52,412 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:23:52,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:23:52,412 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_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/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 -> 711257b3ee0c9d02c2ed443d9c0f84975558d4c1 [2019-12-07 13:23:52,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:23:52,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:23:52,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:23:52,530 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:23:52,531 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:23:52,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i [2019-12-07 13:23:52,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/data/06e0405ea/7dfa761d41b247c28e124c947916a43f/FLAGbef7e7fa2 [2019-12-07 13:23:53,023 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:23:53,023 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i [2019-12-07 13:23:53,034 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/data/06e0405ea/7dfa761d41b247c28e124c947916a43f/FLAGbef7e7fa2 [2019-12-07 13:23:53,352 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/data/06e0405ea/7dfa761d41b247c28e124c947916a43f [2019-12-07 13:23:53,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:23:53,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:23:53,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:23:53,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:23:53,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:23:53,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53, skipping insertion in model container [2019-12-07 13:23:53,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:23:53,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:23:53,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:23:53,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:23:53,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:23:53,715 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:23:53,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53 WrapperNode [2019-12-07 13:23:53,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:23:53,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:23:53,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:23:53,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:23:53,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:23:53,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:23:53,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:23:53,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:23:53,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... [2019-12-07 13:23:53,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:23:53,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:23:53,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:23:53,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:23:53,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/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 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:23:53,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:23:53,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:23:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:23:53,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:23:53,818 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 13:23:54,151 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:23:54,151 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:23:54,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:23:54 BoogieIcfgContainer [2019-12-07 13:23:54,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:23:54,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:23:54,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:23:54,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:23:54,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:23:53" (1/3) ... [2019-12-07 13:23:54,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc63119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:23:54, skipping insertion in model container [2019-12-07 13:23:54,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:23:53" (2/3) ... [2019-12-07 13:23:54,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc63119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:23:54, skipping insertion in model container [2019-12-07 13:23:54,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:23:54" (3/3) ... [2019-12-07 13:23:54,157 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.opt.i [2019-12-07 13:23:54,163 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:23:54,163 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:23:54,167 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:23:54,168 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:23:54,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:23:54,225 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:23:54,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:23:54,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:23:54,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:23:54,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:23:54,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:23:54,238 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:23:54,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:23:54,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:23:54,250 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 13:23:54,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 13:23:54,301 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 13:23:54,301 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:23:54,309 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:23:54,320 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 13:23:54,346 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 13:23:54,346 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:23:54,349 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:23:54,360 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 13:23:54,361 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:23:56,907 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 13:23:57,011 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 13:23:57,011 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 13:23:57,013 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 13:23:57,317 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 13:23:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 13:23:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:23:57,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:57,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:23:57,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 13:23:57,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:23:57,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471894188] [2019-12-07 13:23:57,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:57,474 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 13:23:57,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471894188] [2019-12-07 13:23:57,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:57,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:23:57,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677060480] [2019-12-07 13:23:57,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:23:57,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:23:57,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:23:57,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:23:57,494 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 13:23:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:57,669 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 13:23:57,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:23:57,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:23:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:57,729 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 13:23:57,729 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 13:23:57,730 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 13:23:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 13:23:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 13:23:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 13:23:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 13:23:58,002 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 13:23:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:58,002 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 13:23:58,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:23:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 13:23:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:23:58,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:58,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:23:58,005 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:58,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 13:23:58,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:23:58,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928583323] [2019-12-07 13:23:58,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:58,062 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 13:23:58,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928583323] [2019-12-07 13:23:58,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:58,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:23:58,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850643580] [2019-12-07 13:23:58,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:58,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:23:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:58,064 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 13:23:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:58,341 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 13:23:58,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:23:58,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:23:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:58,394 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 13:23:58,394 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 13:23:58,395 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 13:23:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 13:23:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 13:23:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 13:23:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 13:23:58,693 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 13:23:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:58,694 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 13:23:58,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 13:23:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:23:58,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:58,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:23:58,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 13:23:58,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:23:58,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282323352] [2019-12-07 13:23:58,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:58,765 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 13:23:58,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282323352] [2019-12-07 13:23:58,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:58,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:23:58,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966532800] [2019-12-07 13:23:58,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:23:58,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:23:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:23:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:23:58,766 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 13:23:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:58,979 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 13:23:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:23:58,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:23:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:59,016 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 13:23:59,016 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 13:23:59,016 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 13:23:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 13:23:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 13:23:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 13:23:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 13:23:59,270 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 13:23:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 13:23:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:23:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 13:23:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:23:59,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:59,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:23:59,274 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:59,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 13:23:59,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:23:59,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300608310] [2019-12-07 13:23:59,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:59,336 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 13:23:59,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300608310] [2019-12-07 13:23:59,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:59,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:23:59,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29147355] [2019-12-07 13:23:59,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:23:59,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:23:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:23:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:23:59,338 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 4 states. [2019-12-07 13:23:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:59,360 INFO L93 Difference]: Finished difference Result 2200 states and 5503 transitions. [2019-12-07 13:23:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:23:59,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:23:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:59,363 INFO L225 Difference]: With dead ends: 2200 [2019-12-07 13:23:59,363 INFO L226 Difference]: Without dead ends: 1563 [2019-12-07 13:23:59,363 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 13:23:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-07 13:23:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1547. [2019-12-07 13:23:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-07 13:23:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-07 13:23:59,379 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 16 [2019-12-07 13:23:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:59,380 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-07 13:23:59,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:23:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-07 13:23:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:23:59,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:59,381 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 13:23:59,381 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 13:23:59,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:23:59,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252131927] [2019-12-07 13:23:59,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:59,439 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 13:23:59,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252131927] [2019-12-07 13:23:59,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:59,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:23:59,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356103424] [2019-12-07 13:23:59,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:23:59,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:23:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:23:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:23:59,440 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-07 13:23:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:23:59,698 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-07 13:23:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:23:59,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 13:23:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:23:59,705 INFO L225 Difference]: With dead ends: 2337 [2019-12-07 13:23:59,705 INFO L226 Difference]: Without dead ends: 2285 [2019-12-07 13:23:59,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:23:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-07 13:23:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-07 13:23:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-07 13:23:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-07 13:23:59,740 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-07 13:23:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:23:59,741 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-07 13:23:59,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:23:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-07 13:23:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:23:59,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:23:59,743 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 13:23:59,744 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:23:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:23:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-07 13:23:59,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:23:59,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870275319] [2019-12-07 13:23:59,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:23:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:23:59,801 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 13:23:59,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870275319] [2019-12-07 13:23:59,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:23:59,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:23:59,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767250868] [2019-12-07 13:23:59,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:23:59,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:23:59,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:23:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:23:59,802 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-12-07 13:24:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:00,075 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-07 13:24:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:24:00,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:24:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:00,078 INFO L225 Difference]: With dead ends: 2383 [2019-12-07 13:24:00,078 INFO L226 Difference]: Without dead ends: 2383 [2019-12-07 13:24:00,078 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 13:24:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-07 13:24:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-07 13:24:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-07 13:24:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-07 13:24:00,099 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-07 13:24:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:00,099 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-07 13:24:00,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:24:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-07 13:24:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:24:00,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:00,101 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 13:24:00,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-07 13:24:00,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:00,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884090883] [2019-12-07 13:24:00,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:00,157 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 13:24:00,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884090883] [2019-12-07 13:24:00,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:00,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:24:00,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423078659] [2019-12-07 13:24:00,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:24:00,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:00,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:24:00,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:24:00,158 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-12-07 13:24:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:00,189 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-07 13:24:00,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:24:00,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 13:24:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:00,190 INFO L225 Difference]: With dead ends: 1286 [2019-12-07 13:24:00,190 INFO L226 Difference]: Without dead ends: 1165 [2019-12-07 13:24:00,191 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 13:24:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-07 13:24:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-07 13:24:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-07 13:24:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-07 13:24:00,201 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-07 13:24:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:00,201 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-07 13:24:00,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:24:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-07 13:24:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:24:00,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:00,203 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 13:24:00,203 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-07 13:24:00,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:00,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519565410] [2019-12-07 13:24:00,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:00,253 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 13:24:00,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519565410] [2019-12-07 13:24:00,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:00,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:24:00,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538596059] [2019-12-07 13:24:00,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:24:00,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:00,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:24:00,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:24:00,255 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 3 states. [2019-12-07 13:24:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:00,295 INFO L93 Difference]: Finished difference Result 1488 states and 3143 transitions. [2019-12-07 13:24:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:24:00,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 13:24:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:00,297 INFO L225 Difference]: With dead ends: 1488 [2019-12-07 13:24:00,297 INFO L226 Difference]: Without dead ends: 1488 [2019-12-07 13:24:00,297 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 13:24:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-07 13:24:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1171. [2019-12-07 13:24:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-12-07 13:24:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2513 transitions. [2019-12-07 13:24:00,313 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2513 transitions. Word has length 50 [2019-12-07 13:24:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:00,313 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 2513 transitions. [2019-12-07 13:24:00,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:24:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2513 transitions. [2019-12-07 13:24:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:24:00,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:00,315 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 13:24:00,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2032930801, now seen corresponding path program 1 times [2019-12-07 13:24:00,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:00,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315222862] [2019-12-07 13:24:00,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:00,401 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 13:24:00,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315222862] [2019-12-07 13:24:00,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:00,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:24:00,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212452677] [2019-12-07 13:24:00,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:24:00,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:24:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:00,403 INFO L87 Difference]: Start difference. First operand 1171 states and 2513 transitions. Second operand 6 states. [2019-12-07 13:24:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:00,662 INFO L93 Difference]: Finished difference Result 1382 states and 2902 transitions. [2019-12-07 13:24:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:24:00,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 13:24:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:00,664 INFO L225 Difference]: With dead ends: 1382 [2019-12-07 13:24:00,664 INFO L226 Difference]: Without dead ends: 1382 [2019-12-07 13:24:00,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:24:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-07 13:24:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1153. [2019-12-07 13:24:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-12-07 13:24:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2474 transitions. [2019-12-07 13:24:00,674 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2474 transitions. Word has length 51 [2019-12-07 13:24:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:00,674 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2474 transitions. [2019-12-07 13:24:00,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:24:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2474 transitions. [2019-12-07 13:24:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:24:00,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:00,676 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 13:24:00,676 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1871822573, now seen corresponding path program 2 times [2019-12-07 13:24:00,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:00,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133816609] [2019-12-07 13:24:00,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:00,752 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 13:24:00,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133816609] [2019-12-07 13:24:00,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:00,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:24:00,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512121661] [2019-12-07 13:24:00,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:24:00,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:24:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:24:00,753 INFO L87 Difference]: Start difference. First operand 1153 states and 2474 transitions. Second operand 5 states. [2019-12-07 13:24:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:00,772 INFO L93 Difference]: Finished difference Result 1998 states and 4303 transitions. [2019-12-07 13:24:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:24:00,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 13:24:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:00,773 INFO L225 Difference]: With dead ends: 1998 [2019-12-07 13:24:00,773 INFO L226 Difference]: Without dead ends: 914 [2019-12-07 13:24:00,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:24:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-12-07 13:24:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-12-07 13:24:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-12-07 13:24:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1959 transitions. [2019-12-07 13:24:00,781 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1959 transitions. Word has length 51 [2019-12-07 13:24:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:00,781 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1959 transitions. [2019-12-07 13:24:00,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:24:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1959 transitions. [2019-12-07 13:24:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:24:00,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:00,783 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 13:24:00,783 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash 862603505, now seen corresponding path program 3 times [2019-12-07 13:24:00,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:00,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820395683] [2019-12-07 13:24:00,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:24:00,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820395683] [2019-12-07 13:24:00,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:00,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:24:00,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240036701] [2019-12-07 13:24:00,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:24:00,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:24:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:24:00,825 INFO L87 Difference]: Start difference. First operand 914 states and 1959 transitions. Second operand 3 states. [2019-12-07 13:24:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:00,834 INFO L93 Difference]: Finished difference Result 913 states and 1957 transitions. [2019-12-07 13:24:00,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:24:00,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 13:24:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:00,835 INFO L225 Difference]: With dead ends: 913 [2019-12-07 13:24:00,835 INFO L226 Difference]: Without dead ends: 913 [2019-12-07 13:24:00,835 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 13:24:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-07 13:24:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 759. [2019-12-07 13:24:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 13:24:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-12-07 13:24:00,842 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 51 [2019-12-07 13:24:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:00,842 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-12-07 13:24:00,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:24:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-12-07 13:24:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:24:00,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:00,844 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 13:24:00,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:00,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 1 times [2019-12-07 13:24:00,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:00,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494463224] [2019-12-07 13:24:00,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:01,171 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 13:24:01,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494463224] [2019-12-07 13:24:01,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:01,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:24:01,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104240044] [2019-12-07 13:24:01,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:24:01,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:24:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:24:01,173 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 15 states. [2019-12-07 13:24:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:01,790 INFO L93 Difference]: Finished difference Result 1090 states and 2284 transitions. [2019-12-07 13:24:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:24:01,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-12-07 13:24:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:01,791 INFO L225 Difference]: With dead ends: 1090 [2019-12-07 13:24:01,791 INFO L226 Difference]: Without dead ends: 835 [2019-12-07 13:24:01,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-12-07 13:24:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-07 13:24:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 759. [2019-12-07 13:24:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 13:24:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1637 transitions. [2019-12-07 13:24:01,799 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1637 transitions. Word has length 52 [2019-12-07 13:24:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:01,799 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1637 transitions. [2019-12-07 13:24:01,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:24:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1637 transitions. [2019-12-07 13:24:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:24:01,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:01,800 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 13:24:01,800 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash 680147489, now seen corresponding path program 1 times [2019-12-07 13:24:01,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:01,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878375673] [2019-12-07 13:24:01,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:01,825 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 13:24:01,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878375673] [2019-12-07 13:24:01,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:01,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:24:01,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495444428] [2019-12-07 13:24:01,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:24:01,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:24:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:24:01,827 INFO L87 Difference]: Start difference. First operand 759 states and 1637 transitions. Second operand 3 states. [2019-12-07 13:24:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:01,853 INFO L93 Difference]: Finished difference Result 1051 states and 2244 transitions. [2019-12-07 13:24:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:24:01,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 13:24:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:01,854 INFO L225 Difference]: With dead ends: 1051 [2019-12-07 13:24:01,855 INFO L226 Difference]: Without dead ends: 1051 [2019-12-07 13:24:01,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:24:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-07 13:24:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 837. [2019-12-07 13:24:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-12-07 13:24:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1817 transitions. [2019-12-07 13:24:01,863 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1817 transitions. Word has length 52 [2019-12-07 13:24:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:01,863 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1817 transitions. [2019-12-07 13:24:01,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:24:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1817 transitions. [2019-12-07 13:24:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:24:01,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:01,864 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 13:24:01,864 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1458183254, now seen corresponding path program 2 times [2019-12-07 13:24:01,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:01,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718509194] [2019-12-07 13:24:01,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:24:01,931 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 13:24:01,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718509194] [2019-12-07 13:24:01,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:24:01,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:24:01,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391498788] [2019-12-07 13:24:01,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:24:01,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:24:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:24:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:24:01,932 INFO L87 Difference]: Start difference. First operand 837 states and 1817 transitions. Second operand 7 states. [2019-12-07 13:24:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:24:02,040 INFO L93 Difference]: Finished difference Result 1474 states and 3116 transitions. [2019-12-07 13:24:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:24:02,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 13:24:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:24:02,041 INFO L225 Difference]: With dead ends: 1474 [2019-12-07 13:24:02,041 INFO L226 Difference]: Without dead ends: 970 [2019-12-07 13:24:02,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:24:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-12-07 13:24:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 805. [2019-12-07 13:24:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 13:24:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1738 transitions. [2019-12-07 13:24:02,049 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1738 transitions. Word has length 52 [2019-12-07 13:24:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:24:02,050 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1738 transitions. [2019-12-07 13:24:02,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:24:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1738 transitions. [2019-12-07 13:24:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:24:02,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:24:02,051 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 13:24:02,051 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:24:02,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:24:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 3 times [2019-12-07 13:24:02,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:24:02,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236609816] [2019-12-07 13:24:02,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:24:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:24:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:24:02,110 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:24:02,111 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:24:02,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_40|) 0) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1287~0.base_40|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= (store .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_40| 1) |v_#valid_65|) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1287~0.base_40| 4)) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= 0 |v_ULTIMATE.start_main_~#t1287~0.offset_27|) (= v_~y$r_buff1_thd1~0_115 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_40|) |v_ULTIMATE.start_main_~#t1287~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_~#t1287~0.offset=|v_ULTIMATE.start_main_~#t1287~0.offset_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1287~0.base=|v_ULTIMATE.start_main_~#t1287~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_41|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1287~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1287~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1288~0.base, ULTIMATE.start_main_#t~ite40, ~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_~#t1288~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 13:24:02,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1288~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1288~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13|) |v_ULTIMATE.start_main_~#t1288~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1288~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1288~0.offset] because there is no mapped edge [2019-12-07 13:24:02,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd2~0_In304116532 ~y$r_buff1_thd2~0_Out304116532) (= ~__unbuffered_p0_EAX~0_Out304116532 ~x~0_In304116532) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In304116532)) (= ~y$r_buff0_thd1~0_In304116532 ~y$r_buff1_thd1~0_Out304116532) (= ~y$r_buff0_thd0~0_In304116532 ~y$r_buff1_thd0~0_Out304116532) (= 1 ~y$r_buff0_thd1~0_Out304116532)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In304116532, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In304116532, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In304116532, ~x~0=~x~0_In304116532} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out304116532, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out304116532, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out304116532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out304116532, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In304116532, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In304116532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out304116532, ~x~0=~x~0_In304116532} 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 13:24:02,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2104211569 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2104211569 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2104211569|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2104211569 |P0Thread1of1ForFork0_#t~ite5_Out-2104211569|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2104211569, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2104211569} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2104211569|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2104211569, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2104211569} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:24:02,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1238192650 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1238192650| |P1Thread1of1ForFork1_#t~ite20_Out-1238192650|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1238192650| ~y$w_buff0_used~0_In-1238192650) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1238192650 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1238192650 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1238192650 256))) (and (= (mod ~y$r_buff1_thd2~0_In-1238192650 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1238192650| ~y$w_buff0_used~0_In-1238192650) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1238192650| |P1Thread1of1ForFork1_#t~ite20_Out-1238192650|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1238192650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1238192650|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1238192650, ~weak$$choice2~0=~weak$$choice2~0_In-1238192650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1238192650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1238192650|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1238192650, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1238192650|, ~weak$$choice2~0=~weak$$choice2~0_In-1238192650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:24:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1508630165| |P1Thread1of1ForFork1_#t~ite23_Out-1508630165|)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1508630165 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1508630165 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1508630165 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1508630165 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In-1508630165 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1508630165| |P1Thread1of1ForFork1_#t~ite22_Out-1508630165|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1508630165|) (or (not .cse1) .cse2) (or (not .cse3) .cse2) .cse4 (not .cse5))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1508630165| |P1Thread1of1ForFork1_#t~ite22_Out-1508630165|) (or (and .cse0 (or (and .cse3 .cse6) .cse5 (and .cse1 .cse6)) (= ~y$w_buff1_used~0_In-1508630165 |P1Thread1of1ForFork1_#t~ite23_Out-1508630165|) .cse4) (and (= ~y$w_buff1_used~0_In-1508630165 |P1Thread1of1ForFork1_#t~ite24_Out-1508630165|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1508630165| |P1Thread1of1ForFork1_#t~ite23_In-1508630165|) (not .cse4)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1508630165, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1508630165|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1508630165|, ~weak$$choice2~0=~weak$$choice2~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1508630165, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1508630165|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1508630165|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1508630165|, ~weak$$choice2~0=~weak$$choice2~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 13:24:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1589100980 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1589100980 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1589100980 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1589100980 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1589100980| ~y$w_buff1_used~0_In-1589100980) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1589100980| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1589100980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589100980, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1589100980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1589100980} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1589100980|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1589100980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589100980, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1589100980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1589100980} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:24:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out1469343892 ~y$r_buff0_thd1~0_In1469343892)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1469343892 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1469343892 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd1~0_Out1469343892 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1469343892, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1469343892} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1469343892, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1469343892|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1469343892} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:24:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1011935252 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1011935252 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1011935252 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1011935252 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1011935252| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1011935252| ~y$r_buff1_thd1~0_In1011935252)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1011935252, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011935252, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1011935252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011935252} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1011935252, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011935252, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1011935252|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1011935252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011935252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:24:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} 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 13:24:02,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In60887824 256)))) (or (and (= ~y$r_buff1_thd2~0_In60887824 |P1Thread1of1ForFork1_#t~ite29_Out60887824|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In60887824 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In60887824 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In60887824 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In60887824 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out60887824| |P1Thread1of1ForFork1_#t~ite29_Out60887824|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out60887824| ~y$r_buff1_thd2~0_In60887824) (= |P1Thread1of1ForFork1_#t~ite29_In60887824| |P1Thread1of1ForFork1_#t~ite29_Out60887824|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In60887824, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In60887824|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In60887824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In60887824, ~weak$$choice2~0=~weak$$choice2~0_In60887824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In60887824} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In60887824, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out60887824|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out60887824|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In60887824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In60887824, ~weak$$choice2~0=~weak$$choice2~0_In60887824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In60887824} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:24:02,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:24:02,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1507934704 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1507934704 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1507934704| ~y$w_buff1~0_In1507934704) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1507934704| ~y~0_In1507934704) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1507934704, ~y$w_buff1~0=~y$w_buff1~0_In1507934704, ~y~0=~y~0_In1507934704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1507934704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1507934704, ~y$w_buff1~0=~y$w_buff1~0_In1507934704, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1507934704|, ~y~0=~y~0_In1507934704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1507934704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:24:02,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 13:24:02,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-95969464 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-95969464 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-95969464|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-95969464 |P1Thread1of1ForFork1_#t~ite34_Out-95969464|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-95969464, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-95969464} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-95969464, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-95969464, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-95969464|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:24:02,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-96855278 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-96855278 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-96855278 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-96855278 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-96855278| ~y$w_buff1_used~0_In-96855278)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-96855278| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-96855278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96855278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-96855278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96855278} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-96855278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96855278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-96855278, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-96855278|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96855278} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:24:02,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1525383621 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1525383621 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1525383621| ~y$r_buff0_thd2~0_In-1525383621) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1525383621|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1525383621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1525383621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1525383621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1525383621, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1525383621|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:24:02,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1347078806 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1347078806 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1347078806 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1347078806 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1347078806 |P1Thread1of1ForFork1_#t~ite37_Out-1347078806|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1347078806|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1347078806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1347078806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1347078806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1347078806} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1347078806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1347078806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1347078806, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1347078806|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1347078806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:24:02,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} 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 13:24:02,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 13:24:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:24:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1508052384 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1508052384 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1508052384 |ULTIMATE.start_main_#t~ite40_Out-1508052384|)) (and (or .cse0 .cse1) (= ~y~0_In-1508052384 |ULTIMATE.start_main_#t~ite40_Out-1508052384|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1508052384, ~y~0=~y~0_In-1508052384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1508052384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508052384} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1508052384|, ~y$w_buff1~0=~y$w_buff1~0_In-1508052384, ~y~0=~y~0_In-1508052384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1508052384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508052384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:24:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 13:24:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In167635710 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In167635710 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In167635710 |ULTIMATE.start_main_#t~ite42_Out167635710|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out167635710|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In167635710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167635710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In167635710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167635710, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out167635710|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:24:02,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2111666069 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2111666069 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2111666069 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2111666069 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out2111666069| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out2111666069| ~y$w_buff1_used~0_In2111666069) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2111666069, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2111666069, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2111666069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111666069} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2111666069, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2111666069, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2111666069|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2111666069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111666069} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:24:02,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In233832264 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In233832264 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out233832264| ~y$r_buff0_thd0~0_In233832264)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out233832264| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In233832264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In233832264} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In233832264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In233832264, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out233832264|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:24:02,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1111649824 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1111649824 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1111649824 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1111649824 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1111649824|)) (and (= ~y$r_buff1_thd0~0_In-1111649824 |ULTIMATE.start_main_#t~ite45_Out-1111649824|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111649824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1111649824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1111649824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111649824} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111649824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1111649824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1111649824, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1111649824|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111649824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:24:02,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 13:24:02,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:24:02 BasicIcfg [2019-12-07 13:24:02,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:24:02,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:24:02,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:24:02,160 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:24:02,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:23:54" (3/4) ... [2019-12-07 13:24:02,162 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:24:02,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_40|) 0) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1287~0.base_40|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= (store .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_40| 1) |v_#valid_65|) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1287~0.base_40| 4)) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= 0 |v_ULTIMATE.start_main_~#t1287~0.offset_27|) (= v_~y$r_buff1_thd1~0_115 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_40|) |v_ULTIMATE.start_main_~#t1287~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_~#t1287~0.offset=|v_ULTIMATE.start_main_~#t1287~0.offset_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1287~0.base=|v_ULTIMATE.start_main_~#t1287~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_41|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1287~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1287~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1288~0.base, ULTIMATE.start_main_#t~ite40, ~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_~#t1288~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 13:24:02,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1288~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1288~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13|) |v_ULTIMATE.start_main_~#t1288~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1288~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1288~0.offset] because there is no mapped edge [2019-12-07 13:24:02,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd2~0_In304116532 ~y$r_buff1_thd2~0_Out304116532) (= ~__unbuffered_p0_EAX~0_Out304116532 ~x~0_In304116532) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In304116532)) (= ~y$r_buff0_thd1~0_In304116532 ~y$r_buff1_thd1~0_Out304116532) (= ~y$r_buff0_thd0~0_In304116532 ~y$r_buff1_thd0~0_Out304116532) (= 1 ~y$r_buff0_thd1~0_Out304116532)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In304116532, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In304116532, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In304116532, ~x~0=~x~0_In304116532} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out304116532, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out304116532, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out304116532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In304116532, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out304116532, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In304116532, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In304116532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out304116532, ~x~0=~x~0_In304116532} 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 13:24:02,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2104211569 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2104211569 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2104211569|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2104211569 |P0Thread1of1ForFork0_#t~ite5_Out-2104211569|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2104211569, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2104211569} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2104211569|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2104211569, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2104211569} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:24:02,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1238192650 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1238192650| |P1Thread1of1ForFork1_#t~ite20_Out-1238192650|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1238192650| ~y$w_buff0_used~0_In-1238192650) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1238192650 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1238192650 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1238192650 256))) (and (= (mod ~y$r_buff1_thd2~0_In-1238192650 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1238192650| ~y$w_buff0_used~0_In-1238192650) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1238192650| |P1Thread1of1ForFork1_#t~ite20_Out-1238192650|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1238192650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1238192650|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1238192650, ~weak$$choice2~0=~weak$$choice2~0_In-1238192650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1238192650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238192650, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1238192650|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1238192650, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1238192650|, ~weak$$choice2~0=~weak$$choice2~0_In-1238192650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238192650} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:24:02,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1508630165| |P1Thread1of1ForFork1_#t~ite23_Out-1508630165|)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1508630165 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1508630165 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1508630165 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1508630165 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In-1508630165 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1508630165| |P1Thread1of1ForFork1_#t~ite22_Out-1508630165|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1508630165|) (or (not .cse1) .cse2) (or (not .cse3) .cse2) .cse4 (not .cse5))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1508630165| |P1Thread1of1ForFork1_#t~ite22_Out-1508630165|) (or (and .cse0 (or (and .cse3 .cse6) .cse5 (and .cse1 .cse6)) (= ~y$w_buff1_used~0_In-1508630165 |P1Thread1of1ForFork1_#t~ite23_Out-1508630165|) .cse4) (and (= ~y$w_buff1_used~0_In-1508630165 |P1Thread1of1ForFork1_#t~ite24_Out-1508630165|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1508630165| |P1Thread1of1ForFork1_#t~ite23_In-1508630165|) (not .cse4)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1508630165, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1508630165|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1508630165|, ~weak$$choice2~0=~weak$$choice2~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1508630165, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508630165, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1508630165, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1508630165|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1508630165|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1508630165|, ~weak$$choice2~0=~weak$$choice2~0_In-1508630165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508630165} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 13:24:02,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1589100980 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1589100980 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1589100980 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1589100980 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1589100980| ~y$w_buff1_used~0_In-1589100980) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1589100980| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1589100980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589100980, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1589100980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1589100980} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1589100980|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1589100980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1589100980, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1589100980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1589100980} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:24:02,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out1469343892 ~y$r_buff0_thd1~0_In1469343892)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1469343892 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1469343892 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd1~0_Out1469343892 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1469343892, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1469343892} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1469343892, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1469343892|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1469343892} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:24:02,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1011935252 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1011935252 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1011935252 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1011935252 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1011935252| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1011935252| ~y$r_buff1_thd1~0_In1011935252)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1011935252, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011935252, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1011935252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011935252} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1011935252, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011935252, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1011935252|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1011935252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011935252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:24:02,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} 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 13:24:02,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In60887824 256)))) (or (and (= ~y$r_buff1_thd2~0_In60887824 |P1Thread1of1ForFork1_#t~ite29_Out60887824|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In60887824 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In60887824 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In60887824 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In60887824 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out60887824| |P1Thread1of1ForFork1_#t~ite29_Out60887824|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out60887824| ~y$r_buff1_thd2~0_In60887824) (= |P1Thread1of1ForFork1_#t~ite29_In60887824| |P1Thread1of1ForFork1_#t~ite29_Out60887824|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In60887824, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In60887824|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In60887824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In60887824, ~weak$$choice2~0=~weak$$choice2~0_In60887824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In60887824} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In60887824, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out60887824|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out60887824|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In60887824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In60887824, ~weak$$choice2~0=~weak$$choice2~0_In60887824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In60887824} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:24:02,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:24:02,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1507934704 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1507934704 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1507934704| ~y$w_buff1~0_In1507934704) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1507934704| ~y~0_In1507934704) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1507934704, ~y$w_buff1~0=~y$w_buff1~0_In1507934704, ~y~0=~y~0_In1507934704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1507934704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1507934704, ~y$w_buff1~0=~y$w_buff1~0_In1507934704, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1507934704|, ~y~0=~y~0_In1507934704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1507934704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:24:02,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 13:24:02,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-95969464 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-95969464 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-95969464|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-95969464 |P1Thread1of1ForFork1_#t~ite34_Out-95969464|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-95969464, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-95969464} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-95969464, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-95969464, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-95969464|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:24:02,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-96855278 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-96855278 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-96855278 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-96855278 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-96855278| ~y$w_buff1_used~0_In-96855278)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-96855278| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-96855278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96855278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-96855278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96855278} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-96855278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96855278, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-96855278, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-96855278|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96855278} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:24:02,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1525383621 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1525383621 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1525383621| ~y$r_buff0_thd2~0_In-1525383621) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1525383621|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1525383621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1525383621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1525383621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1525383621, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1525383621|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:24:02,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1347078806 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1347078806 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1347078806 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1347078806 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1347078806 |P1Thread1of1ForFork1_#t~ite37_Out-1347078806|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1347078806|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1347078806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1347078806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1347078806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1347078806} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1347078806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1347078806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1347078806, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1347078806|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1347078806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} 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 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1508052384 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1508052384 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1508052384 |ULTIMATE.start_main_#t~ite40_Out-1508052384|)) (and (or .cse0 .cse1) (= ~y~0_In-1508052384 |ULTIMATE.start_main_#t~ite40_Out-1508052384|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1508052384, ~y~0=~y~0_In-1508052384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1508052384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508052384} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1508052384|, ~y$w_buff1~0=~y$w_buff1~0_In-1508052384, ~y~0=~y~0_In-1508052384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1508052384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508052384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In167635710 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In167635710 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In167635710 |ULTIMATE.start_main_#t~ite42_Out167635710|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out167635710|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In167635710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167635710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In167635710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167635710, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out167635710|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:24:02,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2111666069 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2111666069 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2111666069 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2111666069 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out2111666069| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out2111666069| ~y$w_buff1_used~0_In2111666069) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2111666069, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2111666069, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2111666069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111666069} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2111666069, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2111666069, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2111666069|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2111666069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111666069} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:24:02,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In233832264 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In233832264 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out233832264| ~y$r_buff0_thd0~0_In233832264)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out233832264| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In233832264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In233832264} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In233832264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In233832264, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out233832264|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:24:02,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1111649824 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1111649824 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1111649824 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1111649824 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1111649824|)) (and (= ~y$r_buff1_thd0~0_In-1111649824 |ULTIMATE.start_main_#t~ite45_Out-1111649824|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111649824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1111649824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1111649824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111649824} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111649824, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1111649824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1111649824, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1111649824|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111649824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:24:02,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 13:24:02,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e3fa8f3-141e-4bfa-b2bc-d41e73b47d1c/bin/utaipan/witness.graphml [2019-12-07 13:24:02,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:24:02,219 INFO L168 Benchmark]: Toolchain (without parser) took 8864.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.7 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 246.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,219 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:24:02,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,220 INFO L168 Benchmark]: Boogie Preprocessor took 23.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:24:02,220 INFO L168 Benchmark]: RCFGBuilder took 376.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,220 INFO L168 Benchmark]: TraceAbstraction took 8006.62 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 286.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -71.8 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,220 INFO L168 Benchmark]: Witness Printer took 57.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:24:02,222 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8006.62 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 286.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -71.8 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. * Witness Printer took 57.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L738] 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, 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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L759] 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=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] [L738] 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) [L759] 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) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, 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] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1690 SDtfs, 1910 SDslu, 3831 SDs, 0 SdLazy, 2389 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 6538 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 106913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...