./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 205538613363e7ccc6823ef2dbf50310414045ea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:23:28,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:23:28,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:23:28,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:23:28,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:23:28,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:23:28,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:23:28,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:23:28,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:23:28,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:23:28,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:23:28,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:23:28,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:23:28,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:23:28,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:23:28,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:23:28,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:23:28,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:23:28,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:23:28,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:23:28,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:23:28,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:23:28,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:23:28,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:23:28,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:23:28,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:23:28,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:23:28,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:23:28,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:23:28,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:23:28,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:23:28,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:23:28,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:23:28,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:23:28,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:23:28,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:23:28,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:23:28,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:23:28,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:23:28,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:23:28,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:23:28,453 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:23:28,462 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:23:28,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:23:28,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:23:28,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:23:28,463 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:23:28,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:23:28,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:23:28,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:23:28,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:23:28,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:23:28,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer 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 -> Automizer 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 -> 205538613363e7ccc6823ef2dbf50310414045ea [2019-12-07 18:23:28,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:23:28,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:23:28,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:23:28,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:23:28,575 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:23:28,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix040_power.opt.i [2019-12-07 18:23:28,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/data/5730b720b/54ffdbe7cf8e4e29b05906b3422c1726/FLAG6bbc96822 [2019-12-07 18:23:29,093 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:23:29,093 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/sv-benchmarks/c/pthread-wmm/mix040_power.opt.i [2019-12-07 18:23:29,104 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/data/5730b720b/54ffdbe7cf8e4e29b05906b3422c1726/FLAG6bbc96822 [2019-12-07 18:23:29,112 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/data/5730b720b/54ffdbe7cf8e4e29b05906b3422c1726 [2019-12-07 18:23:29,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:23:29,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:23:29,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:23:29,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:23:29,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:23:29,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29, skipping insertion in model container [2019-12-07 18:23:29,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:23:29,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:23:29,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:23:29,393 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:23:29,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:23:29,481 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:23:29,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29 WrapperNode [2019-12-07 18:23:29,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:23:29,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:23:29,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:23:29,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:23:29,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:23:29,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:23:29,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:23:29,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:23:29,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... [2019-12-07 18:23:29,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:23:29,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:23:29,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:23:29,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:23:29,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/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 18:23:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:23:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:23:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:23:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:23:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:23:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:23:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:23:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:23:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:23:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:23:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:23:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:23:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:23:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:23:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:23:29,584 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:23:29,928 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:23:29,929 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:23:29,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:23:29 BoogieIcfgContainer [2019-12-07 18:23:29,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:23:29,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:23:29,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:23:29,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:23:29,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:23:29" (1/3) ... [2019-12-07 18:23:29,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d42ba33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:23:29, skipping insertion in model container [2019-12-07 18:23:29,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:23:29" (2/3) ... [2019-12-07 18:23:29,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d42ba33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:23:29, skipping insertion in model container [2019-12-07 18:23:29,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:23:29" (3/3) ... [2019-12-07 18:23:29,934 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_power.opt.i [2019-12-07 18:23:29,940 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:23:29,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:23:29,945 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:23:29,945 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:23:29,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,971 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,984 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:29,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:23:30,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:23:30,012 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:23:30,013 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:23:30,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:23:30,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:23:30,013 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:23:30,013 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:23:30,013 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:23:30,013 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:23:30,024 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-07 18:23:30,025 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 18:23:30,077 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 18:23:30,077 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:23:30,085 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 18:23:30,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 18:23:30,125 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 18:23:30,125 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:23:30,129 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 18:23:30,140 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 18:23:30,140 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:23:32,950 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:23:33,150 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:23:33,251 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-07 18:23:33,251 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 18:23:33,254 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-07 18:23:34,688 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-07 18:23:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-07 18:23:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:23:34,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:34,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:34,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-07 18:23:34,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:34,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500203579] [2019-12-07 18:23:34,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:34,881 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 18:23:34,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500203579] [2019-12-07 18:23:34,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:34,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:23:34,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740729835] [2019-12-07 18:23:34,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:23:34,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:23:34,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:34,897 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-07 18:23:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:35,231 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-07 18:23:35,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:23:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:23:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:35,399 INFO L225 Difference]: With dead ends: 26518 [2019-12-07 18:23:35,399 INFO L226 Difference]: Without dead ends: 24958 [2019-12-07 18:23:35,400 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 18:23:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-07 18:23:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-07 18:23:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-07 18:23:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-07 18:23:36,258 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-07 18:23:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:36,260 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-07 18:23:36,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:23:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-07 18:23:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:23:36,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:36,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:36,266 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-07 18:23:36,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:36,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077172079] [2019-12-07 18:23:36,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:36,314 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 18:23:36,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077172079] [2019-12-07 18:23:36,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:36,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:23:36,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062229848] [2019-12-07 18:23:36,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:23:36,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:23:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:36,317 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-12-07 18:23:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:36,525 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-12-07 18:23:36,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:23:36,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 18:23:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:36,622 INFO L225 Difference]: With dead ends: 19953 [2019-12-07 18:23:36,623 INFO L226 Difference]: Without dead ends: 19953 [2019-12-07 18:23:36,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-07 18:23:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-12-07 18:23:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-07 18:23:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-12-07 18:23:37,050 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-12-07 18:23:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:37,050 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-12-07 18:23:37,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:23:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-12-07 18:23:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:23:37,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:37,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:37,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-12-07 18:23:37,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:37,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276382294] [2019-12-07 18:23:37,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,096 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 18:23:37,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276382294] [2019-12-07 18:23:37,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:37,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:37,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26923927] [2019-12-07 18:23:37,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:37,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:37,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:37,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:37,097 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-12-07 18:23:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:37,150 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-12-07 18:23:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:37,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:23:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:37,230 INFO L225 Difference]: With dead ends: 9211 [2019-12-07 18:23:37,230 INFO L226 Difference]: Without dead ends: 9211 [2019-12-07 18:23:37,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-12-07 18:23:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-12-07 18:23:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-07 18:23:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-12-07 18:23:37,382 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-12-07 18:23:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:37,382 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-12-07 18:23:37,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-12-07 18:23:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:23:37,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:37,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:37,385 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-12-07 18:23:37,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:37,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195354433] [2019-12-07 18:23:37,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,425 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 18:23:37,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195354433] [2019-12-07 18:23:37,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:37,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:23:37,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077455230] [2019-12-07 18:23:37,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:37,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:37,427 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 5 states. [2019-12-07 18:23:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:37,461 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-12-07 18:23:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:37,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 18:23:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:37,464 INFO L225 Difference]: With dead ends: 2716 [2019-12-07 18:23:37,465 INFO L226 Difference]: Without dead ends: 2716 [2019-12-07 18:23:37,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-07 18:23:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-07 18:23:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-07 18:23:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-12-07 18:23:37,500 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-12-07 18:23:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:37,500 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-12-07 18:23:37,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-12-07 18:23:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:23:37,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:37,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:37,502 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:37,502 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-07 18:23:37,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:37,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936133279] [2019-12-07 18:23:37,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,555 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 18:23:37,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936133279] [2019-12-07 18:23:37,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:37,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:23:37,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775518038] [2019-12-07 18:23:37,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:37,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:37,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:37,557 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 4 states. [2019-12-07 18:23:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:37,660 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-12-07 18:23:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:37,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:23:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:37,665 INFO L225 Difference]: With dead ends: 3607 [2019-12-07 18:23:37,665 INFO L226 Difference]: Without dead ends: 3607 [2019-12-07 18:23:37,666 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 18:23:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-07 18:23:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-12-07 18:23:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-12-07 18:23:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-12-07 18:23:37,726 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-12-07 18:23:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:37,727 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-12-07 18:23:37,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-12-07 18:23:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:23:37,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:37,732 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] [2019-12-07 18:23:37,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-12-07 18:23:37,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:37,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402685280] [2019-12-07 18:23:37,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:37,792 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 18:23:37,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402685280] [2019-12-07 18:23:37,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:37,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:23:37,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876830485] [2019-12-07 18:23:37,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:37,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:37,793 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 5 states. [2019-12-07 18:23:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:38,021 INFO L93 Difference]: Finished difference Result 4994 states and 14891 transitions. [2019-12-07 18:23:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:23:38,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 18:23:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:38,026 INFO L225 Difference]: With dead ends: 4994 [2019-12-07 18:23:38,026 INFO L226 Difference]: Without dead ends: 4994 [2019-12-07 18:23:38,026 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 18:23:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-07 18:23:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4302. [2019-12-07 18:23:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4302 states. [2019-12-07 18:23:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 12982 transitions. [2019-12-07 18:23:38,087 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 12982 transitions. Word has length 32 [2019-12-07 18:23:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:38,088 INFO L462 AbstractCegarLoop]: Abstraction has 4302 states and 12982 transitions. [2019-12-07 18:23:38,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 12982 transitions. [2019-12-07 18:23:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:23:38,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:38,098 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] [2019-12-07 18:23:38,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-07 18:23:38,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:38,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505223918] [2019-12-07 18:23:38,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:38,131 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 18:23:38,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505223918] [2019-12-07 18:23:38,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:38,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:38,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300537575] [2019-12-07 18:23:38,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:23:38,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:23:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:38,133 INFO L87 Difference]: Start difference. First operand 4302 states and 12982 transitions. Second operand 3 states. [2019-12-07 18:23:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:38,176 INFO L93 Difference]: Finished difference Result 6260 states and 18717 transitions. [2019-12-07 18:23:38,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:23:38,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 18:23:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:38,184 INFO L225 Difference]: With dead ends: 6260 [2019-12-07 18:23:38,184 INFO L226 Difference]: Without dead ends: 6260 [2019-12-07 18:23:38,184 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 18:23:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-12-07 18:23:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 5218. [2019-12-07 18:23:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-12-07 18:23:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 15792 transitions. [2019-12-07 18:23:38,248 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 15792 transitions. Word has length 32 [2019-12-07 18:23:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:38,249 INFO L462 AbstractCegarLoop]: Abstraction has 5218 states and 15792 transitions. [2019-12-07 18:23:38,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:23:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 15792 transitions. [2019-12-07 18:23:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:23:38,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:38,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:38,255 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-07 18:23:38,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:38,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714239540] [2019-12-07 18:23:38,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:38,282 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 18:23:38,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714239540] [2019-12-07 18:23:38,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:38,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:38,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184412230] [2019-12-07 18:23:38,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:23:38,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:23:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:38,284 INFO L87 Difference]: Start difference. First operand 5218 states and 15792 transitions. Second operand 3 states. [2019-12-07 18:23:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:38,320 INFO L93 Difference]: Finished difference Result 6260 states and 18336 transitions. [2019-12-07 18:23:38,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:23:38,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 18:23:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:38,329 INFO L225 Difference]: With dead ends: 6260 [2019-12-07 18:23:38,329 INFO L226 Difference]: Without dead ends: 6260 [2019-12-07 18:23:38,329 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 18:23:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-12-07 18:23:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 5194. [2019-12-07 18:23:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-12-07 18:23:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 15365 transitions. [2019-12-07 18:23:38,429 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 15365 transitions. Word has length 32 [2019-12-07 18:23:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:38,429 INFO L462 AbstractCegarLoop]: Abstraction has 5194 states and 15365 transitions. [2019-12-07 18:23:38,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:23:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 15365 transitions. [2019-12-07 18:23:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:23:38,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:38,435 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] [2019-12-07 18:23:38,435 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-07 18:23:38,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:38,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348922401] [2019-12-07 18:23:38,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:38,482 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 18:23:38,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348922401] [2019-12-07 18:23:38,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:38,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:23:38,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509753150] [2019-12-07 18:23:38,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:23:38,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:38,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:23:38,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:38,483 INFO L87 Difference]: Start difference. First operand 5194 states and 15365 transitions. Second operand 6 states. [2019-12-07 18:23:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:38,525 INFO L93 Difference]: Finished difference Result 4110 states and 12674 transitions. [2019-12-07 18:23:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:23:38,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 18:23:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:38,531 INFO L225 Difference]: With dead ends: 4110 [2019-12-07 18:23:38,531 INFO L226 Difference]: Without dead ends: 4110 [2019-12-07 18:23:38,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2019-12-07 18:23:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3726. [2019-12-07 18:23:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2019-12-07 18:23:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 11542 transitions. [2019-12-07 18:23:38,576 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 11542 transitions. Word has length 32 [2019-12-07 18:23:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:38,576 INFO L462 AbstractCegarLoop]: Abstraction has 3726 states and 11542 transitions. [2019-12-07 18:23:38,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:23:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 11542 transitions. [2019-12-07 18:23:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:23:38,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:38,581 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] [2019-12-07 18:23:38,581 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1467210822, now seen corresponding path program 1 times [2019-12-07 18:23:38,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:38,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080674327] [2019-12-07 18:23:38,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:38,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080674327] [2019-12-07 18:23:38,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:38,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:23:38,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196834893] [2019-12-07 18:23:38,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:23:38,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:23:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:38,661 INFO L87 Difference]: Start difference. First operand 3726 states and 11542 transitions. Second operand 7 states. [2019-12-07 18:23:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:39,182 INFO L93 Difference]: Finished difference Result 6094 states and 18556 transitions. [2019-12-07 18:23:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:23:39,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 18:23:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:39,189 INFO L225 Difference]: With dead ends: 6094 [2019-12-07 18:23:39,189 INFO L226 Difference]: Without dead ends: 6094 [2019-12-07 18:23:39,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:23:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2019-12-07 18:23:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 3870. [2019-12-07 18:23:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2019-12-07 18:23:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 11990 transitions. [2019-12-07 18:23:39,241 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 11990 transitions. Word has length 47 [2019-12-07 18:23:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:39,242 INFO L462 AbstractCegarLoop]: Abstraction has 3870 states and 11990 transitions. [2019-12-07 18:23:39,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:23:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 11990 transitions. [2019-12-07 18:23:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:23:39,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:39,246 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] [2019-12-07 18:23:39,246 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1156074910, now seen corresponding path program 2 times [2019-12-07 18:23:39,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:39,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411852453] [2019-12-07 18:23:39,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:39,295 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 18:23:39,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411852453] [2019-12-07 18:23:39,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:39,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:23:39,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563090260] [2019-12-07 18:23:39,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:23:39,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:39,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:23:39,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:39,296 INFO L87 Difference]: Start difference. First operand 3870 states and 11990 transitions. Second operand 3 states. [2019-12-07 18:23:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:39,318 INFO L93 Difference]: Finished difference Result 3868 states and 11985 transitions. [2019-12-07 18:23:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:23:39,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-07 18:23:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:39,324 INFO L225 Difference]: With dead ends: 3868 [2019-12-07 18:23:39,324 INFO L226 Difference]: Without dead ends: 3868 [2019-12-07 18:23:39,324 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 18:23:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-12-07 18:23:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3254. [2019-12-07 18:23:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-12-07 18:23:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 10180 transitions. [2019-12-07 18:23:39,372 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 10180 transitions. Word has length 47 [2019-12-07 18:23:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:39,372 INFO L462 AbstractCegarLoop]: Abstraction has 3254 states and 10180 transitions. [2019-12-07 18:23:39,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:23:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 10180 transitions. [2019-12-07 18:23:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:23:39,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:39,377 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] [2019-12-07 18:23:39,377 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 203457861, now seen corresponding path program 1 times [2019-12-07 18:23:39,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:39,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339884700] [2019-12-07 18:23:39,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:39,449 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 18:23:39,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339884700] [2019-12-07 18:23:39,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:39,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:39,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776373476] [2019-12-07 18:23:39,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:39,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:39,450 INFO L87 Difference]: Start difference. First operand 3254 states and 10180 transitions. Second operand 4 states. [2019-12-07 18:23:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:39,481 INFO L93 Difference]: Finished difference Result 5704 states and 16210 transitions. [2019-12-07 18:23:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:39,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 18:23:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:39,485 INFO L225 Difference]: With dead ends: 5704 [2019-12-07 18:23:39,485 INFO L226 Difference]: Without dead ends: 3092 [2019-12-07 18:23:39,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2019-12-07 18:23:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2344. [2019-12-07 18:23:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-12-07 18:23:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 6460 transitions. [2019-12-07 18:23:39,513 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 6460 transitions. Word has length 48 [2019-12-07 18:23:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:39,513 INFO L462 AbstractCegarLoop]: Abstraction has 2344 states and 6460 transitions. [2019-12-07 18:23:39,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 6460 transitions. [2019-12-07 18:23:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:23:39,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:39,516 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] [2019-12-07 18:23:39,516 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1519692891, now seen corresponding path program 2 times [2019-12-07 18:23:39,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:39,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485485583] [2019-12-07 18:23:39,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:39,598 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 18:23:39,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485485583] [2019-12-07 18:23:39,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:39,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:23:39,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464024269] [2019-12-07 18:23:39,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:23:39,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:39,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:23:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:39,600 INFO L87 Difference]: Start difference. First operand 2344 states and 6460 transitions. Second operand 7 states. [2019-12-07 18:23:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:39,889 INFO L93 Difference]: Finished difference Result 8330 states and 22092 transitions. [2019-12-07 18:23:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:23:39,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 18:23:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:39,894 INFO L225 Difference]: With dead ends: 8330 [2019-12-07 18:23:39,894 INFO L226 Difference]: Without dead ends: 5657 [2019-12-07 18:23:39,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:23:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2019-12-07 18:23:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 2506. [2019-12-07 18:23:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-12-07 18:23:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6893 transitions. [2019-12-07 18:23:39,935 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6893 transitions. Word has length 48 [2019-12-07 18:23:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:39,935 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 6893 transitions. [2019-12-07 18:23:39,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:23:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6893 transitions. [2019-12-07 18:23:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:23:39,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:39,938 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] [2019-12-07 18:23:39,938 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash -633742729, now seen corresponding path program 3 times [2019-12-07 18:23:39,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:39,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143096011] [2019-12-07 18:23:39,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:40,125 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 18:23:40,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143096011] [2019-12-07 18:23:40,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:40,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:23:40,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049007110] [2019-12-07 18:23:40,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:23:40,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:23:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:23:40,126 INFO L87 Difference]: Start difference. First operand 2506 states and 6893 transitions. Second operand 10 states. [2019-12-07 18:23:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:41,172 INFO L93 Difference]: Finished difference Result 5114 states and 13512 transitions. [2019-12-07 18:23:41,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:23:41,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-12-07 18:23:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:41,177 INFO L225 Difference]: With dead ends: 5114 [2019-12-07 18:23:41,177 INFO L226 Difference]: Without dead ends: 4546 [2019-12-07 18:23:41,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:23:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2019-12-07 18:23:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2662. [2019-12-07 18:23:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2019-12-07 18:23:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 7283 transitions. [2019-12-07 18:23:41,208 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 7283 transitions. Word has length 48 [2019-12-07 18:23:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:41,208 INFO L462 AbstractCegarLoop]: Abstraction has 2662 states and 7283 transitions. [2019-12-07 18:23:41,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:23:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 7283 transitions. [2019-12-07 18:23:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:23:41,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:41,211 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] [2019-12-07 18:23:41,211 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1934642649, now seen corresponding path program 4 times [2019-12-07 18:23:41,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:41,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644547884] [2019-12-07 18:23:41,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:41,259 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 18:23:41,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644547884] [2019-12-07 18:23:41,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:41,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:41,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068213024] [2019-12-07 18:23:41,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:41,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:41,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:41,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:41,260 INFO L87 Difference]: Start difference. First operand 2662 states and 7283 transitions. Second operand 4 states. [2019-12-07 18:23:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:41,278 INFO L93 Difference]: Finished difference Result 4058 states and 10903 transitions. [2019-12-07 18:23:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:41,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 18:23:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:41,280 INFO L225 Difference]: With dead ends: 4058 [2019-12-07 18:23:41,280 INFO L226 Difference]: Without dead ends: 2190 [2019-12-07 18:23:41,281 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 18:23:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2019-12-07 18:23:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2190. [2019-12-07 18:23:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2190 states. [2019-12-07 18:23:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 5941 transitions. [2019-12-07 18:23:41,303 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 5941 transitions. Word has length 48 [2019-12-07 18:23:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:41,303 INFO L462 AbstractCegarLoop]: Abstraction has 2190 states and 5941 transitions. [2019-12-07 18:23:41,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 5941 transitions. [2019-12-07 18:23:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:23:41,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:41,306 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] [2019-12-07 18:23:41,306 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 5 times [2019-12-07 18:23:41,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:41,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447256662] [2019-12-07 18:23:41,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:23:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:23:41,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:23:41,377 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:23:41,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46|) |v_ULTIMATE.start_main_~#t1061~0.offset_30| 0)) |v_#memory_int_25|) (= v_~a~0_68 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46|)) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1061~0.base_46|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1061~0.base_46| 4)) (= v_~y~0_82 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46| 1)) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_30|) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_29|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_45|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_45|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_46|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_26|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_30|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:23:41,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-07 18:23:41,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-07 18:23:41,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-07 18:23:41,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:23:41,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 18:23:41,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 18:23:41,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1354893089 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite8_In-1354893089| |P2Thread1of1ForFork0_#t~ite8_Out-1354893089|) (not .cse0) (= ~z$w_buff0~0_In-1354893089 |P2Thread1of1ForFork0_#t~ite9_Out-1354893089|)) (and (= |P2Thread1of1ForFork0_#t~ite9_Out-1354893089| |P2Thread1of1ForFork0_#t~ite8_Out-1354893089|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1354893089 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1354893089 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1354893089 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1354893089 256) 0)))) (= ~z$w_buff0~0_In-1354893089 |P2Thread1of1ForFork0_#t~ite8_Out-1354893089|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-1354893089|, ~z$w_buff0~0=~z$w_buff0~0_In-1354893089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1354893089, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1354893089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1354893089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1354893089, ~weak$$choice2~0=~weak$$choice2~0_In-1354893089} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-1354893089|, ~z$w_buff0~0=~z$w_buff0~0_In-1354893089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1354893089, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1354893089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1354893089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1354893089, ~weak$$choice2~0=~weak$$choice2~0_In-1354893089, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-1354893089|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 18:23:41,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1860948 256) 0))) (or (and (= ~z$w_buff1~0_In1860948 |P2Thread1of1ForFork0_#t~ite11_Out1860948|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1860948 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1860948 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1860948 256) 0)) (= (mod ~z$w_buff0_used~0_In1860948 256) 0))) (= |P2Thread1of1ForFork0_#t~ite11_Out1860948| |P2Thread1of1ForFork0_#t~ite12_Out1860948|)) (and (= |P2Thread1of1ForFork0_#t~ite11_In1860948| |P2Thread1of1ForFork0_#t~ite11_Out1860948|) (not .cse0) (= ~z$w_buff1~0_In1860948 |P2Thread1of1ForFork0_#t~ite12_Out1860948|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1860948|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1860948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1860948, ~z$w_buff1~0=~z$w_buff1~0_In1860948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1860948, ~weak$$choice2~0=~weak$$choice2~0_In1860948} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1860948|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1860948|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1860948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1860948, ~z$w_buff1~0=~z$w_buff1~0_In1860948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1860948, ~weak$$choice2~0=~weak$$choice2~0_In1860948} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 18:23:41,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1799692160 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_In-1799692160| |P2Thread1of1ForFork0_#t~ite14_Out-1799692160|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite15_Out-1799692160| ~z$w_buff0_used~0_In-1799692160)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite15_Out-1799692160| |P2Thread1of1ForFork0_#t~ite14_Out-1799692160|) (= ~z$w_buff0_used~0_In-1799692160 |P2Thread1of1ForFork0_#t~ite14_Out-1799692160|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1799692160 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1799692160 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1799692160 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1799692160 256)))))))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-1799692160|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799692160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1799692160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799692160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1799692160|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-1799692160|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799692160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1799692160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799692160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 18:23:41,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 18:23:41,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1115521006 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1115521006 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out1115521006| ~z$w_buff0_used~0_In1115521006)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out1115521006| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1115521006} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1115521006|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1115521006} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:23:41,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:23:41,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2072982087 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-2072982087 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2072982087 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2072982087 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out-2072982087| ~z$w_buff1_used~0_In-2072982087)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork1_#t~ite29_Out-2072982087| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2072982087, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072982087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2072982087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2072982087} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2072982087, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-2072982087|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072982087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2072982087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2072982087} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:23:41,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-520889407 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-520889407 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-520889407 ~z$r_buff0_thd4~0_In-520889407))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-520889407) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-520889407} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-520889407, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-520889407|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:23:41,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-419535407 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-419535407 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-419535407 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-419535407 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out-419535407| ~z$r_buff1_thd4~0_In-419535407)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork1_#t~ite31_Out-419535407| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-419535407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-419535407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-419535407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419535407} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-419535407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-419535407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-419535407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419535407, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-419535407|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:23:41,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:23:41,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:23:41,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In922949385 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In922949385 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out922949385| ~z$w_buff1~0_In922949385)) (and (= |ULTIMATE.start_main_#t~ite36_Out922949385| ~z~0_In922949385) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In922949385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922949385, ~z$w_buff1~0=~z$w_buff1~0_In922949385, ~z~0=~z~0_In922949385} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In922949385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922949385, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out922949385|, ~z$w_buff1~0=~z$w_buff1~0_In922949385, ~z~0=~z~0_In922949385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 18:23:41,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 18:23:41,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In262501188 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In262501188 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In262501188 |ULTIMATE.start_main_#t~ite38_Out262501188|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out262501188| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262501188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262501188} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262501188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262501188, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out262501188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:23:41,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-2069088854 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2069088854 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2069088854 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2069088854 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-2069088854| ~z$w_buff1_used~0_In-2069088854)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out-2069088854| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2069088854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2069088854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2069088854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2069088854} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2069088854, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2069088854|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2069088854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2069088854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2069088854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:23:41,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1325027743 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1325027743 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1325027743| ~z$r_buff0_thd0~0_In1325027743) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1325027743|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1325027743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1325027743, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1325027743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:23:41,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-367902746 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-367902746 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-367902746 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-367902746 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-367902746 |ULTIMATE.start_main_#t~ite41_Out-367902746|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-367902746| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367902746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367902746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367902746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367902746} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-367902746|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367902746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367902746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367902746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367902746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 18:23:41,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:23:41,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:23:41 BasicIcfg [2019-12-07 18:23:41,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:23:41,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:23:41,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:23:41,441 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:23:41,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:23:29" (3/4) ... [2019-12-07 18:23:41,443 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:23:41,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46|) |v_ULTIMATE.start_main_~#t1061~0.offset_30| 0)) |v_#memory_int_25|) (= v_~a~0_68 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46|)) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1061~0.base_46|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1061~0.base_46| 4)) (= v_~y~0_82 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46| 1)) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_30|) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_29|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_45|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_45|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_46|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_26|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_30|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:23:41,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-07 18:23:41,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-07 18:23:41,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-07 18:23:41,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:23:41,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 18:23:41,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 18:23:41,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1354893089 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite8_In-1354893089| |P2Thread1of1ForFork0_#t~ite8_Out-1354893089|) (not .cse0) (= ~z$w_buff0~0_In-1354893089 |P2Thread1of1ForFork0_#t~ite9_Out-1354893089|)) (and (= |P2Thread1of1ForFork0_#t~ite9_Out-1354893089| |P2Thread1of1ForFork0_#t~ite8_Out-1354893089|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1354893089 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1354893089 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1354893089 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1354893089 256) 0)))) (= ~z$w_buff0~0_In-1354893089 |P2Thread1of1ForFork0_#t~ite8_Out-1354893089|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-1354893089|, ~z$w_buff0~0=~z$w_buff0~0_In-1354893089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1354893089, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1354893089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1354893089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1354893089, ~weak$$choice2~0=~weak$$choice2~0_In-1354893089} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-1354893089|, ~z$w_buff0~0=~z$w_buff0~0_In-1354893089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1354893089, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1354893089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1354893089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1354893089, ~weak$$choice2~0=~weak$$choice2~0_In-1354893089, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-1354893089|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 18:23:41,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1860948 256) 0))) (or (and (= ~z$w_buff1~0_In1860948 |P2Thread1of1ForFork0_#t~ite11_Out1860948|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1860948 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1860948 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1860948 256) 0)) (= (mod ~z$w_buff0_used~0_In1860948 256) 0))) (= |P2Thread1of1ForFork0_#t~ite11_Out1860948| |P2Thread1of1ForFork0_#t~ite12_Out1860948|)) (and (= |P2Thread1of1ForFork0_#t~ite11_In1860948| |P2Thread1of1ForFork0_#t~ite11_Out1860948|) (not .cse0) (= ~z$w_buff1~0_In1860948 |P2Thread1of1ForFork0_#t~ite12_Out1860948|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1860948|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1860948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1860948, ~z$w_buff1~0=~z$w_buff1~0_In1860948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1860948, ~weak$$choice2~0=~weak$$choice2~0_In1860948} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1860948|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1860948|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1860948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1860948, ~z$w_buff1~0=~z$w_buff1~0_In1860948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1860948, ~weak$$choice2~0=~weak$$choice2~0_In1860948} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 18:23:41,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1799692160 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_In-1799692160| |P2Thread1of1ForFork0_#t~ite14_Out-1799692160|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite15_Out-1799692160| ~z$w_buff0_used~0_In-1799692160)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite15_Out-1799692160| |P2Thread1of1ForFork0_#t~ite14_Out-1799692160|) (= ~z$w_buff0_used~0_In-1799692160 |P2Thread1of1ForFork0_#t~ite14_Out-1799692160|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1799692160 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1799692160 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1799692160 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1799692160 256)))))))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-1799692160|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799692160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1799692160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799692160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1799692160|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-1799692160|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799692160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1799692160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799692160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 18:23:41,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 18:23:41,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1115521006 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1115521006 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out1115521006| ~z$w_buff0_used~0_In1115521006)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out1115521006| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1115521006} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1115521006|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1115521006} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:23:41,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:23:41,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2072982087 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-2072982087 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2072982087 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2072982087 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out-2072982087| ~z$w_buff1_used~0_In-2072982087)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork1_#t~ite29_Out-2072982087| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2072982087, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072982087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2072982087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2072982087} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2072982087, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-2072982087|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072982087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2072982087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2072982087} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-520889407 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-520889407 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-520889407 ~z$r_buff0_thd4~0_In-520889407))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-520889407) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-520889407} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-520889407, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-520889407|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-419535407 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-419535407 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-419535407 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-419535407 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out-419535407| ~z$r_buff1_thd4~0_In-419535407)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork1_#t~ite31_Out-419535407| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-419535407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-419535407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-419535407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419535407} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-419535407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-419535407, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-419535407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419535407, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-419535407|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In922949385 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In922949385 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out922949385| ~z$w_buff1~0_In922949385)) (and (= |ULTIMATE.start_main_#t~ite36_Out922949385| ~z~0_In922949385) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In922949385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922949385, ~z$w_buff1~0=~z$w_buff1~0_In922949385, ~z~0=~z~0_In922949385} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In922949385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922949385, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out922949385|, ~z$w_buff1~0=~z$w_buff1~0_In922949385, ~z~0=~z~0_In922949385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 18:23:41,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In262501188 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In262501188 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In262501188 |ULTIMATE.start_main_#t~ite38_Out262501188|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out262501188| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262501188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262501188} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262501188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262501188, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out262501188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:23:41,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-2069088854 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2069088854 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2069088854 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2069088854 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-2069088854| ~z$w_buff1_used~0_In-2069088854)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out-2069088854| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2069088854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2069088854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2069088854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2069088854} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2069088854, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2069088854|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2069088854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2069088854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2069088854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:23:41,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1325027743 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1325027743 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1325027743| ~z$r_buff0_thd0~0_In1325027743) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1325027743|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1325027743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1325027743, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1325027743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:23:41,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-367902746 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-367902746 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-367902746 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-367902746 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-367902746 |ULTIMATE.start_main_#t~ite41_Out-367902746|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-367902746| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367902746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367902746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367902746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367902746} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-367902746|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367902746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367902746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367902746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367902746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 18:23:41,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:23:41,506 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_880233a5-456c-426c-9924-fc7082a9ac1e/bin/uautomizer/witness.graphml [2019-12-07 18:23:41,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:23:41,507 INFO L168 Benchmark]: Toolchain (without parser) took 12392.28 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 617.6 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -295.5 MB). Peak memory consumption was 322.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:41,507 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:23:41,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -116.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:41,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.44 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:41,508 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:23:41,508 INFO L168 Benchmark]: RCFGBuilder took 386.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.2 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:41,509 INFO L168 Benchmark]: TraceAbstraction took 11510.82 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 535.3 MB). Free memory was 989.2 MB in the beginning and 1.3 GB in the end (delta: -273.2 MB). Peak memory consumption was 262.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:41,509 INFO L168 Benchmark]: Witness Printer took 65.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:41,510 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -116.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.44 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 386.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.2 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11510.82 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 535.3 MB). Free memory was 989.2 MB in the beginning and 1.3 GB in the end (delta: -273.2 MB). Peak memory consumption was 262.1 MB. Max. memory is 11.5 GB. * Witness Printer took 65.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2092 SDtfs, 2310 SDslu, 4237 SDs, 0 SdLazy, 1961 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 11997 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 98087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...